Sciweavers

3875 search results - page 165 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
TIP
1998
128views more  TIP 1998»
15 years 6 months ago
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
Antonin Chambolle, Ronald A. DeVore, Nam-Yong Lee,...
SODA
2004
ACM
156views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
Yuval Emek, David Peleg
ICDT
2005
ACM
149views Database» more  ICDT 2005»
16 years 1 days ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
EAAI
2010
119views more  EAAI 2010»
15 years 5 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 8 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari