5948 search results - page 235 / 1190 » Computing Robust Counter-Strategies |
156
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
156
Voted
CCS
2003
ACM
15 years 9 months ago
2003
ACM
Network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate “stepping stones” to conceal their identity and origin...
138
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Most methods for the recognition of shape classes from 3D datasets focus on classifying clean, often manually generated models. However, 3D shapes obtained through acquisition tech...
136
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
159
Voted
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...