Sciweavers

10146 search results - page 74 / 2030
» Fast FAST
Sort
View
JMLR
2002
117views more  JMLR 2002»
13 years 10 months ago
Learning to Construct Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
TNN
1998
85views more  TNN 1998»
13 years 9 months ago
Fast numerical integration of relaxation oscillator networks based on singular limit solutions
—Relaxation oscillations exhibiting more than one time scale arise naturally from many physical systems. When relaxation oscillators are coupled in a way that resembles chemical ...
P. S. Linsay, DeLiang L. Wang
CVPR
2011
IEEE
13 years 6 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
CVPR
2011
IEEE
13 years 6 months ago
Fast Cost-Volume Filtering for Visual Correspondence and Beyond
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
Christoph Rhemann, Asmaa Hosni, Michael Bleyer, Ca...
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...