Sciweavers

8776 search results - page 1340 / 1756
» Robust Data Clustering
Sort
View
182
Voted
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 7 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
16 years 7 months ago
Nantonac collaborative filtering: recommendation based on order responses
A recommender system suggests the items expected to be preferred by the users. Recommender systems use collaborative filtering to recommend items by summarizing the preferences of...
Toshihiro Kamishima
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
16 years 7 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
245
Voted
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
16 years 6 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...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 6 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
« Prev « First page 1340 / 1756 Last » Next »