1272 search results - page 138 / 255 » Approximate Parameterized Matching |
130
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
A visually-optimal quantization and rate-control strategy based on results of recent contrast sensitivity and suprathreshold summation experiments is proposed. At suprathreshold c...
107
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
119
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
152
Voted
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
114
Voted
PRL
2007
15 years 3 months ago
2007
We introduce a new method for the recognition of partially occluded objects represented only by their contours. Object description, which stems from the inflection point detectio...