Sciweavers

184 search results - page 21 / 37
» Near Neighbor Search in Large Metric Spaces
Sort
View
ICML
2007
IEEE
15 years 10 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
ICRA
2010
IEEE
343views Robotics» more  ICRA 2010»
14 years 8 months ago
Hands in action: real-time 3D reconstruction of hands in interaction with objects
— This paper presents a method for vision based estimation of the pose of human hands in interaction with objects. Despite the fact that most robotics applications of human hand ...
Javier Romero, Hedvig Kjellström, Danica Krag...
86
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
75
Voted
FLAIRS
2003
14 years 11 months ago
Alternate Strategies for Retrieval in State-Spaces
In our previous research, we investigated the properties of case-based plan recognition with incomplete plan libraries. Incremental construction of plan libraries along with retri...
Boris Kerkez, Michael T. Cox
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
15 years 2 months ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf