6274 search results - page 79 / 1255 » From query complexity to computational complexity |
121
Voted
DCC
2006
IEEE
15 years 9 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...
145
Voted
CONEXT
2007
ACM
15 years 7 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...
134
Voted
WG
2010
Springer
15 years 2 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...
152
Voted
DCG
2011
14 years 10 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...
123
Voted
PKDD
2004
Springer
15 years 9 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...