Sciweavers

1337 search results - page 95 / 268
» Fast computation of distance estimators
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Mixture Trees for Modeling and Fast Conditional Sampling with Applications in Vision and Graphics
We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tr...
Frank Dellaert, Vivek Kwatra, Sang Min Oh
ICIP
2010
IEEE
15 years 4 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
VTC
2006
IEEE
16 years 25 days ago
An Initial Timing Offset Estimation Method for OFDM Systems in Rayleigh Fading Channel
- An initial timing offset estimation method for orthogonal frequency-division multiplexing (OFDM) systems is proposed. Conventional preamble-based synchronization methods result i...
Seung Duk Choi, Jung Min Choi, Jae Hong Lee
LAWEB
2003
IEEE
16 years 3 days ago
Estimating the Development Effort of Web Projects in Chile
This article presents a method to fast estimate the development effort of Web-based information systems in Chile. The method, called Chilean Web Application Development Effort Est...
Sergio F. Ochoa, M. Cecilia Bastarrica, Germ&aacut...
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
16 years 7 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