Sciweavers

2657 search results - page 198 / 532
» On the complexity of hierarchical problem solving
Sort
View
115
Voted
ICDAR
2005
IEEE
15 years 7 months ago
A Statistical Learning Approach To Document Image Analysis
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
Kevin Laven, Scott Leishman, Sam T. Roweis
NIPS
2004
15 years 3 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan
99
Voted
UAI
2004
15 years 3 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
107
Voted
CSUR
2000
69views more  CSUR 2000»
15 years 1 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet
JAIR
2006
101views more  JAIR 2006»
15 years 1 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee