158 search results - page 16 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
86
Voted
ISTCS
1993
Springer
15 years 1 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
SODA
2012
ACM
13 years 2 days ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
76
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper addresses the dynamics of broadcast flooding in random wireless ad hoc networks. In particular, we study the subset of nodes covered by a flood as well as timing is...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not...