387 search results - page 63 / 78 » Many Random Walks Are Faster Than One |
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
ASPLOS
2012
ACM
12 years 4 months ago
2012
ACM
The rise of multi-core processors has shifted performance efforts towards parallel programs. However, single-threaded code, whether from legacy programs or ones difficult to para...
VEE
2012
ACM
12 years 4 months ago
2012
ACM
As cloud-based computation becomes increasingly important, providing a general computational interface to support datacenterscale programming has become an imperative research age...
TKDE
2012
11 years 11 months ago
2012
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....