Sciweavers

1021 search results - page 181 / 205
» Fast Approximate PCPs
Sort
View
ECCV
2006
Springer
14 years 11 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
WWW
2008
ACM
14 years 10 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
GRAPHITE
2003
ACM
14 years 2 months ago
Smooth surface reconstruction from noisy range data
This paper shows that scattered range data can be smoothed at low cost by fitting a Radial Basis Function (RBF) to the data and convolving with a smoothing kernel (low pass filt...
Jonathan C. Carr, Richard K. Beatson, Bruce C. McC...
IPPS
2000
IEEE
14 years 2 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 2 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang