Sciweavers

377 search results - page 59 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
ECCV
2004
Springer
14 years 10 months ago
Scene and Motion Reconstruction from Defocused and Motion-Blurred Images via Anisotropic Diffusion
We propose a solution to the problem of inferring the depth map, radiance and motion of a scene from a collection of motion-blurred and defocused images. We model motion-blur and d...
Paolo Favaro, Martin Burger, Stefano Soatto
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 1 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICCS
2005
Springer
14 years 2 months ago
MC Slicing for Volume Rendering Applications
Recent developments in volume visualization using standard graphics hardware provide an effective and interactive way to understand and interpret the data. Mainly based on 3d text...
A. Benassarou, Eric Bittar, N. W. John, Laurent Lu...
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 10 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
IPPS
2010
IEEE
13 years 6 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...