Sciweavers

5595 search results - page 1109 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
EDBT
2012
ACM
291views Database» more  EDBT 2012»
12 years 12 months ago
Relevance search in heterogeneous networks
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...
Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie...
CVPR
2007
IEEE
15 years 11 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
CVPR
2008
IEEE
15 years 11 months ago
Physical simulation for probabilistic motion tracking
Human motion tracking is an important problem in computer vision. Most prior approaches have concentrated on efficient inference algorithms and prior motion models; however, few c...
Marek Vondrak, Leonid Sigal, Odest Chadwicke Jenki...
WWW
2005
ACM
15 years 10 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 10 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas
« Prev « First page 1109 / 1119 Last » Next »