4865 search results - page 351 / 973 » The Complexity of Graph Connectivity |
191
click to vote
DICTA
2003
15 years 8 months ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
175
click to vote
FCS
2009
15 years 4 months ago
2009
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
160
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
176
click to vote
ACSD
2006
IEEE
16 years 25 days ago
2006
IEEE
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
198
click to vote
INFOCOM
2005
IEEE
16 years 10 days ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...