2252 search results - page 124 / 451 » Lower Bounds for Dynamic Algorithms |
124
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
131
click to vote
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
166
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
113
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
129
Voted
JMMA
2010
14 years 10 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...