13306 search results - page 388 / 2662 » Theoretical Computer Science |
217
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
183
click to vote
IFIPTCS
2000
15 years 10 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
172
Voted
GI
2009
Springer
15 years 4 months ago
2009
Springer
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
167
click to vote
FOCS
2005
IEEE
16 years 13 days ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
194
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. One important challenge in data mining is to extract interesting knowledge and useful information for expert users. Since data mining algorithms extracts a huge quantity ...