Sciweavers

69 search results - page 6 / 14
» A New Distance Algorithm and Its Application to General Forc...
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 10 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
SPIRE
2005
Springer
15 years 9 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
156
Voted
CVPR
2005
IEEE
16 years 6 months ago
Efficient Mean-Shift Tracking via a New Similarity Measure
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
ISCI
2007
141views more  ISCI 2007»
15 years 3 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
143
Voted
DAGSTUHL
2007
15 years 5 months ago
Relevance Matrices in LVQ
Abstract. We propose a new matrix learning scheme to extend Generalized Relevance Learning Vector Quantization (GRLVQ). By introducing a full matrix of relevance factors in the dis...
Petra Schneider