Sciweavers

8232 search results - page 1530 / 1647
» Dynamic Logic Programming
Sort
View
115
Voted
AAAI
2011
14 years 2 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...
135
Voted
CIMCA
2008
IEEE
15 years 8 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
14 years 2 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
PC
2012
228views Management» more  PC 2012»
13 years 10 months ago
DAGuE: A generic distributed DAG engine for High Performance Computing
— The frenetic development of the current architectures places a strain on the current state-of-the-art programming environments. Harnessing the full potential of such architectu...
George Bosilca, Aurelien Bouteiller, Anthony Danal...
CVPR
2012
IEEE
13 years 4 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
« Prev « First page 1530 / 1647 Last » Next »