2517 search results - page 80 / 504 » Specifying Weak Sets |
131
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...
171
click to vote
ECCV
2006
Springer
16 years 7 months ago
2006
Springer
Cascades of boosted ensembles have become popular in the object detection community following their highly successful introduction in the face detector of Viola and Jones [1]. In t...
152
Voted
ISCAS
2003
IEEE
15 years 10 months ago
2003
IEEE
Many watermarking algorithms embed the watermark into the image as contiguous non-overlapping tiles. This tiling structure forms an implicit synchronization template that can be r...
136
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
153
click to vote
DBPL
2007
Springer
15 years 9 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...