Sciweavers

1037 search results - page 71 / 208
» Learning of Boolean Functions Using Support Vector Machines
Sort
View
ICIP
2001
IEEE
14 years 10 months ago
Higher order autocorrelations for pattern classification
The use of higher-order local autocorrelations as features for pattern recognition has been acknowledged since many years, but their applicability was restricted to relatively low...
Vlad Popovici, Jean-Philippe Thiran
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 9 months ago
When is there a representer theorem? Vector versus matrix regularizers
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
CIDM
2007
IEEE
14 years 1 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
DAC
1994
ACM
14 years 1 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 23 days ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio