1477 search results - page 232 / 296 » On Graph Problems in a Semi-streaming Model |
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
111
click to vote
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
ISCC
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper studies the fairness with which competing flows share the channel in ad hoc networks using collision avoidance protocols. It is shown that the required multihop coordi...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract—This work considers the problem of reaching consensus in an unreliable linear consensus network. A solution to this problem is relevant for several tasks in multi-agent ...