Sciweavers

1763 search results - page 299 / 353
» A Formalization of Polytime Functions
Sort
View
FTML
2008
185views more  FTML 2008»
14 years 9 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
IEE
2008
115views more  IEE 2008»
14 years 9 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
CORR
2006
Springer
130views Education» more  CORR 2006»
14 years 9 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
CORR
2006
Springer
159views Education» more  CORR 2006»
14 years 9 months ago
Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
Michael Brinkmeier
ENTCS
2006
136views more  ENTCS 2006»
14 years 9 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand