Sciweavers

605 search results - page 10 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
JCDCG
2004
Springer
14 years 1 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
FOCS
1992
IEEE
13 years 11 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
ADG
2004
Springer
189views Mathematics» more  ADG 2004»
14 years 1 months ago
nD Polyhedral Scene Reconstruction from Single 2D Line Drawing by Local Propagation
In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general nD polyhedral scene from a single 2D line drawing. With the ide...
Hongbo Li
ICIP
2008
IEEE
14 years 9 months ago
Pedestrian detection via logistic multiple instance boosting
Pedestrian detection in still image should handle the large appearance and pose variations arising from the articulated structure and various clothing of human bodies as well as v...
Junbiao Pang, Qingming Huang, Shuqiang Jiang, Wen ...
OOPSLA
2005
Springer
14 years 1 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine