466 search results - page 51 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
175
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
178
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...
164
click to vote
SECON
2007
IEEE
16 years 10 days ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
192
click to vote
DATAMINE
1999
15 years 5 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
140
click to vote
IROS
2006
IEEE
16 years 3 days ago
2006
IEEE
— 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...