Sciweavers

515 search results - page 66 / 103
» Layouts of Expander Graphs
Sort
View
ECCC
2006
134views more  ECCC 2006»
13 years 10 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 9 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
SIGCSE
2000
ACM
120views Education» more  SIGCSE 2000»
14 years 3 months ago
PILOT: an interactive tool for learning and grading
We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use...
Stina S. Bridgeman, Michael T. Goodrich, Stephen G...
ICCAD
1996
IEEE
90views Hardware» more  ICCAD 1996»
14 years 2 months ago
A coloring approach to the structural diagnosis of interconnects
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
Xiao-Tao Chen, Fabrizio Lombardi
ICALP
2009
Springer
14 years 11 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald