280 search results - page 10 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
87
Voted
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
BMVC
2010
14 years 9 months ago
2010
In this paper, we present a graph-based image segmentation method (patch-cuts) that incorporates features and spatial relations obtained from image patches. In the first step, pat...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
DAC
1998
ACM
16 years 19 days ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...