108 search results - page 7 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
FOCS
2002
IEEE
14 years 12 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We address the problem of multiclass object detection. Our aims are to enable models for new categories to benefit from the detectors built previously for other categories, and fo...
ECCV
2004
Springer
14 years 26 days ago
2004
Springer
This paper presents an analysis of the design of classifiers for use in a hierarchical object recognition approach. In this approach, a cascade of classifiers is arranged in a tr...
ITNG
2010
IEEE
14 years 16 days ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...