Sciweavers

2127 search results - page 142 / 426
» Computing large matchings fast
Sort
View
VLDB
1998
ACM
180views Database» more  VLDB 1998»
15 years 8 months ago
Active Storage for Large-Scale Data Mining and Multimedia
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using t...
Erik Riedel, Garth A. Gibson, Christos Faloutsos
CVPR
2011
IEEE
15 years 6 days 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...
ICCAD
1995
IEEE
110views Hardware» more  ICCAD 1995»
15 years 7 months ago
Fast functional simulation using branching programs
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
Pranav Ashar, Sharad Malik
CMPB
2010
152views more  CMPB 2010»
15 years 4 months ago
Fast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
Marc Modat, Gerard R. Ridgway, Zeike A. Taylor, Ma...
ICASSP
2011
IEEE
14 years 7 months ago
Fast orthogonal decomposition of Volterra cubic kernels using oblique unfolding
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
Rémy Boyer, Roland Badeau, Gérard Fa...