Sciweavers

62 search results - page 5 / 13
» A Fast Time Stepping Method for Evaluating Fractional Integr...
Sort
View
ARITH
2007
IEEE
13 years 11 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
DAC
2000
ACM
13 years 11 months ago
Fast power grid simulation
The decrease in feature size and added chip functionality in large sub-micron integrated circuits demand larger grids for power distribution. Since power grids are performance lim...
Sani R. Nassif, Joseph N. Kozhaya
MICCAI
2009
Springer
14 years 4 months ago
Fast Automatic Segmentation of the Esophagus from 3D CT Data Using a Probabilistic Model
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
Johannes Feulner, Shaohua Kevin Zhou, Alexander Ca...
ICASSP
2007
IEEE
14 years 1 months ago
Fast Line-Based Imaging of Small Sample Features
This project aims to reduce the time required to attain more detailed scans of small interesting regions present in a quick first-pass sample image. In particular, we concentrate...
Mark A. Iwen, Gurjit S. Mandair, Michael D. Morris...
CVPR
2010
IEEE
14 years 2 months ago
A Square-Root Sampling Approach to Fast Histogram-Based Search
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
Huang-Wei Chang, Hwann-Tzong Chen