Sciweavers

4843 search results - page 301 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
JIIS
2002
141views more  JIIS 2002»
15 years 3 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
148
Voted
CVPR
2010
IEEE
15 years 2 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
134
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 2 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
PODS
2003
ACM
157views Database» more  PODS 2003»
16 years 4 months ago
Algorithms for data migration with cloning
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
167
Voted
ECCV
2006
Springer
16 years 5 months ago
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
The bilateral filter is a nonlinear filter that smoothes a signal while preserving strong edges. It has demonstrated great effectiveness for a variety of problems in computer visio...
Frédo Durand, Sylvain Paris