Sciweavers

1248 search results - page 174 / 250
» On the Number of Birch Partitions
Sort
View
109
Voted
WWW
2008
ACM
16 years 1 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 1 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
114
Voted
HPCA
2006
IEEE
16 years 1 months ago
High performance file I/O for the Blue Gene/L supercomputer
Parallel I/O plays a crucial role for most data-intensive applications running on massively parallel systems like Blue Gene/L that provides the promise of delivering enormous comp...
Hao Yu, Ramendra K. Sahoo, C. Howson, G. Almasi, J...
154
Voted
HPCA
2003
IEEE
16 years 1 months ago
A Methodology for Designing Efficient On-Chip Interconnects on Well-Behaved Communication Patterns
As the level of chip integration continues to advance at a fast pace, the desire for efficient interconnects-whether on-chip or off-chip--is rapidly increasing. Traditional interc...
Wai Hong Ho, Timothy Mark Pinkston
179
Voted
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 26 days ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu