Sciweavers

2485 search results - page 196 / 497
» Time Bounded Frequency Computations
Sort
View
SPAA
2006
ACM
16 years 14 days ago
A performance analysis of local synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
ICIP
1994
IEEE
16 years 8 months ago
Document Image Decoding
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
Gary E. Kopec, Philip A. Chou
ASPDAC
2010
ACM
120views Hardware» more  ASPDAC 2010»
15 years 4 months ago
Wideband reduced modeling of interconnect circuits by adaptive complex-valued sampling method
In this paper, we propose a new wideband model order reduction method for interconnect circuits by using a novel adaptive sampling and error estimation scheme. We try to address t...
Hai Wang, Sheldon X.-D. Tan, Gengsheng Chen
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
SIGGRAPH
1993
ACM
15 years 10 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max