2252 search results - page 107 / 451 » Lower Bounds for Dynamic Algorithms |
146
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
128
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
128
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
123
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
138
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...