Sciweavers

240 search results - page 14 / 48
» Robust Multi-Objective Optimization in High Dimensional Spac...
Sort
View
NIPS
2007
14 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
NIPS
2003
14 years 11 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 2 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
NLDB
2005
Springer
15 years 3 months ago
On Some Optimization Heuristics for Lesk-Like WSD Algorithms
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
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...