Sciweavers

505 search results - page 51 / 101
» Universal Constructions for Large Objects
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 4 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
133
Voted
PDP
2008
IEEE
15 years 10 months ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín
SISAP
2008
IEEE
147views Data Mining» more  SISAP 2008»
15 years 10 months ago
An Empirical Evaluation of a Distributed Clustering-Based Index for Metric Space Databases
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
Veronica Gil Costa, Mauricio Marín, Nora Re...
DAGM
2008
Springer
15 years 6 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
PROPERTYTESTING
2010
15 years 2 months ago
Short Locally Testable Codes and Proofs: A Survey in Two Parts
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
Oded Goldreich