Sciweavers

704 search results - page 97 / 141
» Learning the Ideal Evaluation Function
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 4 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
ICML
2005
IEEE
14 years 10 months ago
A brain computer interface with online feedback based on magnetoencephalography
The aim of this paper is to show that machine learning techniques can be used to derive a classifying function for human brain signal data measured by magnetoencephalography (MEG)...
Bernhard Schölkopf, Hubert Preißl, J&uu...
ICPR
2010
IEEE
14 years 3 months ago
On-Line Random Naive Bayes for Tracking
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
ISCIS
2005
Springer
14 years 3 months ago
Classification of Volatile Organic Compounds with Incremental SVMs and RBF Networks
Support Vector Machines (SVMs) have been applied to solve the classification of volatile organic compounds (VOC) data in some recent studies. SVMs provide good generalization perfo...
Zeki Erdem, Robi Polikar, Nejat Yumusak, Fikret S....
EUROCRYPT
1999
Springer
14 years 2 months ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail