2520 search results - page 71 / 504 » The complexity of approximating entropy |
ICASSP
2010
IEEE
14 years 10 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 ...
74
Voted
JC
2006
14 years 10 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...
75
Voted
CORR
2004
Springer
14 years 10 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)-...
LATIN
1998
Springer
15 years 2 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...
NIPS
2004
14 years 11 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...