Sciweavers

174 search results - page 19 / 35
» Fast equation automaton computation
Sort
View
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
15 years 6 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
15 years 5 months ago
Anatomically-Aware, Automatic, and Fast Registration of 3D Ear Impression Models
We present a registration framework based on feature points of anatomical 3D shapes represented in the point cloud domain. Anatomical information is utilized throughout the comple...
Alexander Zouhar, Tong Fang, Gozde B. Unal, Gregor...
BIRTHDAY
1994
Springer
15 years 3 months ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones
DAC
2004
ACM
16 years 22 days ago
Large-scale full-wave simulation
We describe a new extraction tool, EMX (Electro-Magnetic eXtractor), for the analysis of RF, analog and high-speed digital circuits. EMX is a fast full-wave field solver. It incor...
Sharad Kapur, David E. Long
FCCM
2006
IEEE
111views VLSI» more  FCCM 2006»
15 years 5 months ago
Pipelined Mixed Precision Algorithms on FPGAs for Fast and Accurate PDE Solvers from Low Precision Components
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
Robert Strzodka, Dominik Göddeke