Sciweavers

695 search results - page 10 / 139
» The structure of intrinsic complexity of learning
Sort
View
IJDMB
2010
128views more  IJDMB 2010»
13 years 4 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
BC
1998
98views more  BC 1998»
13 years 7 months ago
The dynamics of long-term exploration in the rat
A simple analytical model is proposed here that captures to a large extent the kinematic structure of rat exploratory behavior. Previous studies have shown that such behavior consi...
Ofer Tchernichovski, Yoav Benjamini, Ilan Golani
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
14 years 1 months ago
QuteSAT: a robust circuit-based SAT solver for complex circuit structure
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang...
PAMI
2008
119views more  PAMI 2008»
13 years 7 months ago
Triplet Markov Fields for the Classification of Complex Structure Data
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...
Juliette Blanchet, Florence Forbes
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng