736 search results - page 144 / 148 » A dynamic data structure for approximate range searching |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
CGF
2007
13 years 8 months ago
2007
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
ISBI
2011
IEEE
13 years 8 days ago
2011
IEEE
Network structures formed by actin filaments are present in many kinds of fluorescence microscopy images. In order to quantify the conformations and dynamics of such actin fila...
OHS
2001
Springer
14 years 1 months ago
2001
Springer
Adaptation/personalization is one of the main issues for web applications and require large repositories. Creating adaptive web applications from these repositories requires to hav...