723 search results - page 125 / 145 » On the hyperbolicity constant in graphs |
101
click to vote
DAC
1994
ACM
15 years 3 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
104
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
84
Voted
COCO
2008
Springer
15 years 1 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
123
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
102
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...