Sciweavers

1282 search results - page 50 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Aligning traces for performance evaluation
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 1 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 11 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 16 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ICCS
2003
Springer
14 years 28 days ago
A Compress-Based Association Mining Algorithm for Large Dataset
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith