126 search results - page 4 / 26 » Finding links and initiators: a graph reconstruction problem |
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
NETWORKING
2008
14 years 11 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
107
click to vote
ICIW
2009
IEEE
14 years 7 months ago
2009
IEEE
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
AAAI
1990
14 years 11 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...