Sciweavers

331 search results - page 47 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
82
Voted
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 9 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 1 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
ACL
2010
14 years 7 months ago
Extraction and Approximation of Numerical Attributes from the Web
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...
Dmitry Davidov, Ari Rappoport
JUCS
2002
163views more  JUCS 2002»
14 years 9 months ago
Finding Plagiarisms among a Set of Programs with JPlag
: JPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java ...
Lutz Prechelt, Guido Malpohl, Michael Philippsen
ICCV
2007
IEEE
15 years 11 months ago
Non-metric affinity propagation for unsupervised image categorization
Unsupervised categorization of images or image parts is often needed for image and video summarization or as a preprocessing step in supervised methods for classification, trackin...
Delbert Dueck, Brendan J. Frey