565 search results - page 85 / 113 » Geometry of Upper Probabilities |
STACS
2004
Springer
14 years 3 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
DCC
2003
IEEE
14 years 3 months ago
2003
IEEE
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
ICCAD
2003
IEEE
14 years 3 months ago
2003
IEEE
Process variations have become a critical issue in performance verification of high-performance designs. We present a new, statistical timing analysis method that accounts for int...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
ISTCS
1993
Springer
14 years 2 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...