83 search results - page 15 / 17 » Bounding Loop Iterations for Timing Analysis |
90
Voted
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
74
Voted
ICCSA
2004
Springer
15 years 2 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
SIGGRAPH
1996
ACM
15 years 1 months ago
1996
ACM
Scratches on old films must be removed since these are more noticeable on higher definition and digital televisions. Wires that suspend actors or cars must be carefully erased dur...
QEST
2008
IEEE
15 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
88
Voted
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...