367 search results - page 64 / 74 » Tight lower bounds for the online labeling problem |
COLT
1994
Springer
13 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
CJ
2006
13 years 7 months ago
2006
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...