Sciweavers

849 search results - page 124 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
DAC
2005
ACM
14 years 10 months ago
Race-condition-aware clock skew scheduling
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...
Shih-Hsu Huang, Yow-Tyng Nieh, Feng-Pin Lu
DAC
2005
ACM
14 years 10 months ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
ISBI
2008
IEEE
14 years 10 months ago
Real-time segmentation of 4D ultrasound by Active Geometric Functions
Four-dimensional ultrasound based on matrix phased array transducers can capture the complex 4D cardiac motion in a complete and real-time fashion. However, the large amount of in...
Qi Duan, Elsa D. Angelini, Shunichi Homma, Andrew ...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 9 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CHI
2004
ACM
14 years 9 months ago
Persistence matters: making the most of chat in tightly-coupled work
How much history of the dialogue should a chat client include? Some chat clients have minimized the dialogue history to deploy the space for other purposes. A theory of conversati...
Darren Gergle, David R. Millen, Robert E. Kraut, S...