Sciweavers

5055 search results - page 94 / 1011
» Relative Timing
Sort
View
SIGMETRICS
1998
ACM
127views Hardware» more  SIGMETRICS 1998»
15 years 2 months ago
On Calibrating Measurements of Packet Transit Times
We discuss the problem of detecting errors in measurements of the total delay experienced by packets transmitted through a wide-area network. We assume that we have measurements o...
Vern Paxson
90
Voted
COCO
1993
Springer
78views Algorithms» more  COCO 1993»
15 years 6 months ago
The Quantitative Structure of Exponential Time
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
Jack H. Lutz
120
Voted
DAC
1995
ACM
15 years 6 months ago
Rephasing: A Transformation Technique for the Manipulation of Timing Constraints
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
Miodrag Potkonjak, Mani B. Srivastava
138
Voted
IJVR
2007
171views more  IJVR 2007»
15 years 2 months ago
Real Time Rendering and Animation of Virtual Characters
—In this paper, we focus on the different aspects of real time visualization and animation of realistic virtual characters. The common goal for our research was to come up with s...
Yvonne Jung, Christian Knöpfle
PAMI
2010
112views more  PAMI 2010»
15 years 1 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum