97 search results - page 11 / 20 » Tight lower bounds for halfspace range searching |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
ALGORITHMICA
2005
13 years 7 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
GI
2009
Springer
13 years 5 months ago
2009
Springer
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...