Sciweavers

5995 search results - page 124 / 1199
» Algorithmic Game Theory
Sort
View
115
Voted
JMLR
2006
105views more  JMLR 2006»
15 years 3 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
128
Voted
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 10 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
145
Voted
ECCV
2006
Springer
15 years 7 months ago
Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm
We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (lowresolution) im...
Hui Ji, Cornelia Fermüller
94
Voted
INFSOF
2006
73views more  INFSOF 2006»
15 years 3 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
111
Voted
DMTCS
2003
93views Mathematics» more  DMTCS 2003»
15 years 5 months ago
Two Philosophical Applications of Algorithmic Information Theory
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
Gregory J. Chaitin