2680 search results - page 162 / 536 » The topology of the independence complex |
141
click to vote
DAM
2002
15 years 1 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
128
click to vote
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
118
click to vote
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper is about the automated discovery and mapping of surfaces using a stereo pair. We begin with the observation that for any workspace which is topologically connected (i.e....
ECAL
2003
Springer
15 years 6 months ago
2003
Springer
Building large complex minds is difficult because we do not understand what the necessary components are or how they should interact. Even if the components were known it is diffic...
113
click to vote
PAMI
2007
15 years 26 days ago
2007
We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifier...