61 search results - page 12 / 13 » Probable Innocence Revisited |
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
COMPGEOM
2010
ACM
14 years 16 days 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...
HUC
2009
Springer
14 years 2 days ago
2009
Springer
In this paper we describe a new Bayesian estimation approach for simultaneous mapping and localization for pedestrians based on odometry with foot mounted inertial sensors. When s...
PAMI
2007
13 years 7 months ago
2007
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—In recent years, the famous wiretap channel has been revisited by many researchers and information theoretic secrecy has become an active area of research in this setting. In th...