463 search results - page 66 / 93 » A General Framework for Graph Sparsification |
189
Voted
SIGMOD
2012
ACM
13 years 5 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
131
Voted
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
137
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
125
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
143
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...