4865 search results - page 343 / 973 » The Complexity of Graph Connectivity |
169
click to vote
FAC
2002
15 years 6 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
211
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
229
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
158
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
190
click to vote
SMA
2008
ACM
15 years 6 months ago
2008
ACM
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...