Sciweavers

4926 search results - page 37 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
DAM
2011
13 years 2 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
12 years 10 months ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...
GD
2004
Springer
14 years 1 months ago
Algorithms for Drawing Media
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
David Eppstein
GFKL
2005
Springer
105views Data Mining» more  GFKL 2005»
14 years 1 months ago
Implications of Probabilistic Data Modeling for Mining Association Rules
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. In the current literature, the properties of algorithms to mine ass...
Michael Hahsler, Kurt Hornik, Thomas Reutterer