461 search results - page 12 / 93 » Bounds for Validation |
ECCC
2000
13 years 10 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
PODC
1991
ACM
14 years 2 months ago
1991
ACM
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is de...
INFOCOM
2005
IEEE
14 years 4 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
SAT
2005
Springer
14 years 4 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
CVPR
2001
IEEE
15 years 27 days ago
2001
IEEE
This paper presents a method for computing the visual hull that is based on two novel representations: the rim mesh, which describes the connectivity of contour generators on the ...