Sciweavers

1403 search results - page 76 / 281
» Set cover algorithms for very large datasets
Sort
View
TPDS
2010
176views more  TPDS 2010»
14 years 8 months ago
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
Roberto Baldoni, Angelo Corsaro, Leonardo Querzoni...
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
14 years 11 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
IJBRA
2010
116views more  IJBRA 2010»
14 years 8 months ago
Scaling alignment of large ontologies
: In recent years, the number of ontologies shared on the Web has increased dramatically, supporting a growing set of applications such as biological knowledge sharing, enhanced se...
Suzette Stoutenburg, Jugal Kalita, Kaily Ewing, Li...
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
15 years 10 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
14 years 11 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar