417 search results - page 25 / 84 » Some Theory for Generalized Boosting Algorithms |
PODS
2001
ACM
14 years 9 months ago
2001
ACM
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms ...
DLT
2003
13 years 10 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
Abstract— Redundant manipulators have some advantages when compared with classical arms because they allow the trajectory optimization, both on the free space and on the presence...
PODS
2007
ACM
14 years 9 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...