Sciweavers

2304 search results - page 346 / 461
» On the Vulnerability of Large Graphs
Sort
View
88
Voted
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
16 years 1 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
104
Voted
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 1 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
97
Voted
RECOMB
2007
Springer
16 years 1 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...
199
Voted
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
16 years 26 days ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
139
Voted
SOSP
2009
ACM
15 years 9 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard