Sciweavers

1110 search results - page 186 / 222
» Clustering with the Connectivity Kernel
Sort
View
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
14 years 9 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
14 years 9 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
14 years 9 months ago
JouleSort: a balanced energy-efficiency benchmark
The energy efficiency of computer systems is an important concern in a variety of contexts. In data centers, reducing energy use improves operating cost, scalability, reliability,...
Suzanne Rivoire, Mehul A. Shah, Parthasarathy Rang...
DCC
2006
IEEE
14 years 8 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley