Sciweavers

1576 search results - page 248 / 316
» Streaming Algorithms for Independent Sets
Sort
View
121
Voted
FOCS
2000
IEEE
15 years 6 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
SIGGRAPH
1996
ACM
15 years 6 months ago
Scale-Dependent Reproduction of Pen-and-Ink Illustrations
This paper describes a representation for pen-and-ink illustrations that allows the creation of high-fidelity illustrations at any scale or resolution. We represent a pen-and-ink ...
Michael Salisbury, Corin R. Anderson, Dani Lischin...
78
Voted
STACS
1997
Springer
15 years 6 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt
117
Voted
DAC
2010
ACM
15 years 5 months ago
Performance yield-driven task allocation and scheduling for MPSoCs under process variation
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
Lin Huang, Qiang Xu
GD
2006
Springer
15 years 5 months ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren