817 search results - page 21 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
DAC
1997
ACM
14 years 24 days ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
FOCS
1991
IEEE
14 years 4 days ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
CASES
2005
ACM
13 years 10 months ago
2005
ACM
Digital Signal Processing (DSP) is becoming increasingly widespread in portable devices. Due to harsh constraints on power, latency, and throughput in embedded environments, devel...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
JCM
2008
13 years 8 months ago
2008
In this work a joint clock recovery (CR) and equalization scheme for short burst transmissions is presented. The joint optimization performance may be pursued by means of both data...