2957 search results - page 181 / 592 » The Complexity of Polynomial-Time Approximation |
394
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
171
Voted
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
141
click to vote
JC
2006
15 years 6 months ago
2006
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
151
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
131
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...