676 search results - page 48 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
101
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
110
click to vote
SSWMC
2004
15 years 3 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
135
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
209
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
127
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...