Sciweavers

679 search results - page 92 / 136
» Scaling Clustering Algorithms to Large Databases
Sort
View
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
16 years 3 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
144
Voted
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
15 years 11 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
CVPR
2004
IEEE
16 years 3 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
MIDDLEWARE
2004
Springer
15 years 7 months ago
Ganymed: Scalable Replication for Transactional Web Applications
Data grids, large scale web applications generating dynamic content and database service providing pose significant scalability challenges to database engines. Replication is the ...
Christian Plattner, Gustavo Alonso
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
15 years 7 months ago
Association Rule Mining in Peer-to-Peer Systems
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
Ran Wolff, Assaf Schuster