605 search results - page 11 / 121 » Geometrical Structure of Boosting Algorithm |
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
AIRWEB
2007
Springer
14 years 1 months ago
2007
Springer
Nowadays web spamming has emerged to take the economic advantage of high search rankings and threatened the accuracy and fairness of those rankings. Understanding spamming techniq...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
WSCG
2001
13 years 9 months ago
2001
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...