Sciweavers

2354 search results - page 122 / 471
» Radio number for trees
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 12 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
CVPR
2007
IEEE
16 years 8 months ago
City-Scale Location Recognition
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
Grant Schindler, Matthew Brown, Richard Szeliski
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
16 years 13 days ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
15 years 12 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle
159
Voted
VRST
2003
ACM
15 years 11 months ago
Partitioning crowded virtual environments
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
Anthony Steed, Roula Abou-Haidar