Sciweavers

481 search results - page 61 / 97
» Learning relational probability trees
Sort
View
ICTAI
2008
IEEE
14 years 2 months ago
Answering Complex Questions Using Query-Focused Summarization Technique
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
Yllias Chali, Shafiq R. Joty
ROMAN
2007
IEEE
127views Robotics» more  ROMAN 2007»
14 years 1 months ago
Incremental on-line hierarchical clustering of whole body motion patterns
Abstract— This paper describes a novel algorithm for autonomous and incremental learning of motion pattern primitives by observation of human motion. Human motion patterns are ed...
Dana Kulic, Wataru Takano, Yoshihiko Nakamura
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
TSMC
2008
100views more  TSMC 2008»
13 years 7 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson