Sciweavers

1897 search results - page 330 / 380
» Sparse Additive Machine
Sort
View
114
Voted
COLT
2006
Springer
15 years 4 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 4 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
126
Voted
CASES
2005
ACM
15 years 2 months ago
An Esterel processor with full preemption support and its worst case reaction time analysis
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
Xin Li, Jan Lukoschus, Marian Boldt, Michael Harde...
FLAIRS
2004
15 years 2 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang
95
Voted
FLAIRS
2006
15 years 2 months ago
Computer-Aided Language Processing
The invited talk will introduce Computer-Aided Language Processing (CALP) as an emerging area of practical interest and significance and will present experiments of several CALP a...
Ruslan Mitkov