1538 search results - page 146 / 308 » Spectral Techniques in Graph Algorithms |
129
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
128
click to vote
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
175
click to vote
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
132
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a technique to detect instances of classes (objects) according to their semantic definition in the form of a Description Graph. Classes are defined as combinat...
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...