820 search results - page 103 / 164 » Inducing Temporal Graphs |
132
click to vote
ICDCS
2009
IEEE
16 years 12 days ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
106
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
125
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
123
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
106
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...