583 search results - page 49 / 117 » Efficient algorithms for constructing decision trees with co... |
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
JUCS
2008
14 years 9 months ago
2008
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
CGF
2006
14 years 9 months ago
2006
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
109
click to vote
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
The Distributed Constraint Optimization Problem (DCOP) is a fundamental formalism for multi-agent cooperation. A dedicated framework called Resource Constrained DCOP (RCDCOP) has ...