Sciweavers

762 search results - page 26 / 153
» Finding Facilities Fast
Sort
View
CLEF
2009
Springer
14 years 10 months ago
Patent Retrieval Experiments in the Context of the CLEF IP Track 2009
At CLEF 2009 the University of Hildesheim focused on the main task of the Intellectual Property Track which aims at finding prior art for a specified patent [cf. Information Retri...
Daniela Becks, Christa Womser-Hacker, Thomas Mandl...
ICIP
2002
IEEE
15 years 11 months ago
New dictionary and fast atom searching method for matching pursuit representation of displaced frame difference
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...
Fulvio Moschetti, Lorenzo Granai, Pierre Vanderghe...
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
16 years 4 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...
ICIP
2004
IEEE
15 years 11 months ago
Fast motion estimation and motion segmentation using multi-scale approach
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...
Cédric Demonceaux, Djemâa Kachi-Akkou...