494 search results - page 22 / 99 » Heap Building Bounds |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
84
Voted
WOWMOM
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we build on known bounds on localization in sensor networks and provide new insights that can be used in multiple-access design from a localization perspective. Spe...
SODA
2003
ACM
15 years 13 hour ago
2003
ACM
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
UAI
2004
15 years 22 hour ago
2004
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is perfor...
96
Voted
ADC
2008
Springer
15 years 5 months ago
2008
Springer
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...