ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
PODS
2008
ACM
14 years 4 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
We present x.qui.site, a scalable system for managing recommendations for social tagging sites like del.icio.us. seamlessly incorporates various user behaviors into the recommenda...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
The primary purpose of news articles is to convey information about who, what, when and where. But learning and summarizing these relationships for collections of thousands to mil...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
In the paper, we present an approach to mining a directed social network from a message board on the Internet where vertices denote individuals and directed links denote the flow ...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...