Sciweavers

2988 search results - page 61 / 598
» Experiments with a New Boosting Algorithm
Sort
View
JSAT
2008
63views more  JSAT 2008»
14 years 9 months ago
Whose side are you on? Finding solutions in a biased search-tree
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
Marijn Heule, Hans van Maaren
IJCNN
2007
IEEE
15 years 4 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
GFKL
2007
Springer
166views Data Mining» more  GFKL 2007»
15 years 3 months ago
Classifying Number Expressions in German Corpora
Number and date expressions are essential information items in corpora and therefore play a major role in various text mining applications. However, so far number expressions were ...
Irene M. Cramer, Stefan Schacht, Andreas Merkel
ACL
2007
14 years 11 months ago
A Comparative Study of Parameter Estimation Methods for Statistical Natural Language Processing
This paper presents a comparative study of five parameter estimation algorithms on four NLP tasks. Three of the five algorithms are well-known in the computational linguistics com...
Jianfeng Gao, Galen Andrew, Mark Johnson, Kristina...