Sciweavers

1403 search results - page 4 / 281
» Set cover algorithms for very large datasets
Sort
View
IDEAL
2004
Springer
13 years 11 months ago
DESCRY: A Density Based Clustering Algorithm for Very Large Data Sets
Fabrizio Angiulli, Clara Pizzuti, Massimo Ruffolo
CIKM
2007
Springer
14 years 4 days ago
External perfect hashing for very large key sets
We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature ...
Fabiano C. Botelho, Nivio Ziviani
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 6 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ACL
2001
13 years 7 months ago
Scaling to Very Very Large Corpora for Natural Language Disambiguation
The amount of readily available on-line text has reached hundreds of billions of words and continues to grow. Yet for most core natural language tasks, algorithms continue to be o...
Michele Banko, Eric Brill
JMLR
2007
104views more  JMLR 2007»
13 years 5 months ago
Comments on the "Core Vector Machines: Fast SVM Training on Very Large Data Sets"
In a recently published paper in JMLR, Tsang et al. (2005) present an algorithm for SVM called Core Vector Machines (CVM) and illustrate its performances through comparisons with ...
Gaëlle Loosli, Stéphane Canu