Sciweavers

1646 search results - page 67 / 330
» fast 2007
Sort
View
133
Voted
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
110
Voted
SGP
2007
15 years 6 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
133
Voted
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Very fast watermarking by reversible contrast mapping
—Reversible contrast mapping (RCM) is a simple integer transform that applies to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the least significant bits...
Dinu Coltuc, Jean-Marc Chassery
133
Voted
NAR
2007
106views more  NAR 2007»
15 years 3 months ago
INFO-RNA - a server for fast inverse RNA folding satisfying sequence constraints
INFO-RNA is a new web server for designing RNA sequences that fold into a user given secondary structure. Furthermore, constraints on the sequence can be specified, e.g. one can r...
Anke Busch, Rolf Backofen
137
Voted
FIMH
2007
Springer
15 years 9 months ago
Automated, Accurate and Fast Segmentation of 4D Cardiac MR Images
Based on discrete mathematical morphology, we propose a new automated and fast procedure to segment the left ventricular myocardium in 4D (3D+t) cine-MRI sequences. Thanks to the c...
Jean Cousty, Laurent Najman, Michel Couprie, St&ea...