2252 search results - page 152 / 451 » Lower Bounds for Dynamic Algorithms |
126
Voted
ALT
2006
Springer
16 years 12 days ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
174
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
118
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
133
click to vote
COMCOM
1998
15 years 3 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
118
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...