Sciweavers

4255 search results - page 202 / 851
» On Learning Boolean Functions
Sort
View
ISMIR
2004
Springer
145views Music» more  ISMIR 2004»
15 years 12 months ago
Methodological Considerations Concerning Manual Annotation Of Musical Audio In Function Of Algorithm Development
In research on musical audio-mining, annotated music databases are needed which allow the development of computational tools that extract from the musical audiostream the kind of ...
Micheline Lesaffre, Marc Leman, Bernard De Baets, ...
NAACL
2010
15 years 4 months ago
Softmax-Margin CRFs: Training Log-Linear Models with Cost Functions
We describe a method of incorporating taskspecific cost functions into standard conditional log-likelihood (CLL) training of linear structured prediction models. Recently introduc...
Kevin Gimpel, Noah A. Smith
ICML
2007
IEEE
16 years 7 months ago
Analyzing feature generation for value-function approximation
We analyze a simple, Bellman-error-based approach to generating basis functions for valuefunction approximation. We show that it generates orthogonal basis functions that provably...
Ronald Parr, Christopher Painter-Wakefield, Lihong...
ML
2002
ACM
140views Machine Learning» more  ML 2002»
15 years 6 months ago
A Probabilistic Framework for SVM Regression and Error Bar Estimation
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...
Junbin Gao, Steve R. Gunn, Chris J. Harris, Martin...
STACS
2001
Springer
15 years 11 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel