463 search results - page 50 / 93 » A General Framework for Graph Sparsification |
145
Voted
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
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 ...
140
Voted
JDA
2006
15 years 3 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
234
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
121
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
133
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...