Sciweavers

14165 search results - page 633 / 2833
» The generalized two-server problem
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
AIPS
2003
15 years 8 months ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
CVPR
2005
IEEE
16 years 9 months ago
Tracking Non-Stationary Appearances and Dynamic Feature Selection
Since the appearance changes of the target jeopardize visual measurements and often lead to tracking failure in practice, trackers need to be adaptive to non-stationary appearance...
Ming Yang, Ying Wu
ICIP
2001
IEEE
16 years 8 months ago
On the estimation of spectral data: a genetic algorithm approach
Spectral data estimation from image data is an ill-posed problem since (i) due to the integral nature of solid-state light sensors the same output can be obtained from an infinity...
Amâncio Santos, António Dourado, Bern...
ICML
2008
IEEE
16 years 8 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...