Sciweavers

696 search results - page 44 / 140
» A class of combinatorial identities
Sort
View
AI
1999
Springer
15 years 5 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
COGSCI
2004
108views more  COGSCI 2004»
15 years 6 months ago
Making the ineffable explicit: estimating the information employed for face classifications
When we look at a face, we readily perceive that person's gender, expression, identity, age, and attractiveness. Perceivers as well as scientists have hitherto had little suc...
Michael C. Mangini, Irving Biederma
AAAI
2010
15 years 6 months ago
Multi-Task Sparse Discriminant Analysis (MtSDA) with Overlapping Categories
Multi-task learning aims at combining information across tasks to boost prediction performance, especially when the number of training samples is small and the number of predictor...
Yahong Han, Fei Wu, Jinzhu Jia, Yueting Zhuang, Bi...
LICS
1999
IEEE
15 years 10 months ago
Some Decision Problems of Enormous Complexity
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
Harvey Friedman
ERSHOV
2006
Springer
15 years 9 months ago
Linear Complementarity and P-Matrices for Stochastic Games
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
Ola Svensson, Sergei G. Vorobyov