315 search results - page 16 / 63 » Cell-probe lower bounds for the partial match problem |
105
Voted
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
95
Voted
DAGSTUHL
2004
15 years 3 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
100
click to vote
ISAAC
2009
Springer
15 years 8 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...
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
136
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...