3055 search results - page 386 / 611 » Randomized Search Trees |
145
click to vote
PPAM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
133
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
123
click to vote
CAEPIA
2003
Springer
15 years 9 months ago
2003
Springer
A new method for ensemble generation is presented. It is based on grouping the attributes in dierent subgroups, and to apply, for each group, an axis rotation, using Principal Com...
183
click to vote
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
129
click to vote
ICML
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...