Sciweavers

624 search results - page 120 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
ALT
2003
Springer
13 years 11 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
14 years 2 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
AMAI
2004
Springer
14 years 1 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
BMCBI
2005
99views more  BMCBI 2005»
13 years 7 months ago
CGH-Profiler: Data mining based on genomic aberration profiles
Background: CGH-Profiler is a program that supports the analysis of genomic aberrations measured by Comparative Genomic Hybridisation (CGH). Comparative genomic hybridisation (CGH...
Falk Schubert, Bernhard Tausch, Stefan Joos, Rolan...
BMCBI
2010
155views more  BMCBI 2010»
13 years 7 months ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe