2283 search results - page 136 / 457 » Bounds of Graph Characteristics |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
ECCC
1998
13 years 7 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
ICCD
2006
IEEE
14 years 5 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
IV
2009
IEEE
14 years 2 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...