Sciweavers

4372 search results - page 251 / 875
» Algorithmic Theories of Everything
Sort
View
COLT
2000
Springer
15 years 10 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
DAGSTUHL
2007
15 years 7 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
COLING
2000
15 years 7 months ago
A Model of Competence for Corpus-Based Machine Translation
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...
Michael Carl
COMPGEOM
2010
ACM
15 years 10 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
CSL
2010
Springer
15 years 7 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek