Sciweavers

6110 search results - page 108 / 1222
» Approximate Computing
Sort
View
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 6 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
ML
2012
ACM
385views Machine Learning» more  ML 2012»
14 years 1 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
CVPR
2007
IEEE
16 years 8 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ECCV
2006
Springer
16 years 8 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