6274 search results - page 79 / 1255 » From query complexity to computational complexity |
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
CONEXT
2007
ACM
14 years 1 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
WG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
DCG
2011
13 years 5 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
PKDD
2004
Springer
14 years 3 months ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...