Sciweavers

5096 search results - page 642 / 1020
» Landscape of Clustering Algorithms
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 7 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
16 years 4 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
16 years 3 months ago
Congestion Aware Layout Driven Logic Synthesis
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
Thomas Kutzschebauch, Leon Stok
PDP
2008
IEEE
16 years 1 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
NBIS
2007
Springer
16 years 29 days ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero