905 search results - page 124 / 181 » On the Complexity of uSPR Distance |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
CSCW
2004
ACM
15 years 3 months ago
2004
ACM
Open-source software development projects are almost always collaborative and distributed. Despite the difficulties imposed by distance, these projects have managed to produce lar...
CSCW
2004
ACM
15 years 3 months ago
2004
ACM
Collaborative authoring is a common workplace task. Yet, despite improvements in word processors, communication software, and file sharing, many problems continue to plague co-aut...
PCM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Vector quantization (VQ) is an elementary technique for image compression. However, the complexity of searching the nearest codeword in a codebook is time-consuming. In t...
WG
2004
Springer
15 years 3 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...