356 search results - page 21 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
125
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
136
click to vote
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
127
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
166
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
121
click to vote
ICTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...