Sciweavers

2446 search results - page 350 / 490
» Choiceless Polynomial Time
Sort
View
NIPS
2008
13 years 9 months ago
Near-minimax recursive density estimation on the binary hypercube
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
Maxim Raginsky, Svetlana Lazebnik, Rebecca Willett...
ISTA
2007
13 years 9 months ago
Game Theory-based Data Mining Technique for Strategy Making of a Soccer Simulation Coach Agent
: Soccer simulation is an effort to motivate researchers to perform artificial and robotic intelligence investigations in a multi-agent system framework. In this paper, we propose ...
Amin Milani Fard, Vahid Salmani, Mahmoud Naghibzad...
PLANX
2008
13 years 9 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
NIPS
2007
13 years 9 months ago
Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representa...
Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille...
AAAI
2006
13 years 9 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir