Sciweavers

2570 search results - page 153 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 6 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
FPGA
1998
ACM
176views FPGA» more  FPGA 1998»
15 years 7 months ago
A Fast Routability-Driven Router for FPGAs
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute powe...
Jordan S. Swartz, Vaughn Betz, Jonathan Rose
134
Voted
ICIP
1998
IEEE
16 years 5 months ago
Fast Blind Inverse Halftoning
We present a fast, non-iterative technique for producing grayscale images from error diffused and dithered halftones. The first stage of the algorithm consists of a Gaussian filte...
Niranjan Damera-Venkata, Thomas D. Kite, Mahalaksh...
122
Voted
ASPDAC
2007
ACM
110views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Fast Placement Optimization of Power Supply Pads
Power grid networks in VLSI circuits are required to provide adequate input supply to ensure reliable performance. In this paper, we propose algorithms to find the placement of pow...
Yu Zhong, Martin D. F. Wong
138
Voted
DCOSS
2009
Springer
15 years 10 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...