Sciweavers

2312 search results - page 31 / 463
» On the Dimensionality of Face Space
Sort
View
WWW
2009
ACM
15 years 10 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
ICASSP
2011
IEEE
14 years 1 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi
DGCI
2008
Springer
14 years 11 months ago
Characterizing and Detecting Toric Loops in n-Dimensional Discrete Toric Spaces
Toric spaces being non-simply connected, it is possible to find in such spaces some loops which are not homotopic to a point: we call them toric loops. Some applications, such as t...
John Chaussard, Gilles Bertrand, Michel Couprie
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 1 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani