Sciweavers

250 search results - page 26 / 50
» A metric cache for similarity search
Sort
View
TALG
2010
158views more  TALG 2010»
14 years 6 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
CVPR
2010
IEEE
15 years 8 months ago
Semi-supervised Hashing for Scalable Image Retrieval
Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several hashing methods have been proposed to allow approx...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
SIGIR
2010
ACM
15 years 3 months ago
Probabilistic latent maximal marginal relevance
Diversity has been heavily motivated in the information retrieval literature as an objective criterion for result sets in search and recommender systems. Perhaps one of the most w...
Shengbo Guo, Scott Sanner
ITS
2004
Springer
153views Multimedia» more  ITS 2004»
15 years 5 months ago
Modeling Students' Reasoning About Qualitative Physics: Heuristics for Abductive Proof Search
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Maxim Makatchev, Pamela W. Jordan, Kurt VanLehn
GLOBECOM
2008
IEEE
14 years 12 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu