Sciweavers

10146 search results - page 95 / 2030
» Fast FAST
Sort
View
ICIP
2002
IEEE
16 years 4 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
147
Voted
VIS
2003
IEEE
116views Visualization» more  VIS 2003»
16 years 3 months ago
Space Efficient Fast Isosurface Extraction for Large Datasets
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
Udeepta Bordoloi, Han-Wei Shen
90
Voted
ISBI
2006
IEEE
16 years 3 months ago
Fast regularized reconstruction of non-uniformly subsampled parallel MRI data
Parallel MR imaging is an effective approach to reduce MR image acquisition time. Non-uniform subsampling allows one to tailor the subsampling scheme for improved image quality at...
William Scott Hoge, Misha Elena Kilmer, Steven Hak...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 2 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
16 years 2 months ago
A Fast Buffered Routing Tree Construction Algorithm under Accurate Delay Model
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
Yibo Wang, Yici Cai, Xianlong Hong