417 search results - page 61 / 84 » Some Theory for Generalized Boosting Algorithms |
131
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
148
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
121
click to vote
CADE
2007
Springer
15 years 8 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
116
click to vote
COLT
1999
Springer
15 years 6 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
101
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...