133 search results - page 27 / 27 » Approximation bounds for Black Hole Search problems |
125
Voted
TASE
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
124
Voted
COCO
2005
Springer
15 years 5 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...
116
click to vote
CIKM
2008
Springer
15 years 1 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...