Sciweavers

15033 search results - page 93 / 3007
» Complexity Theory and Algorithms
Sort
View
174
Voted
EC
1998
178views ECommerce» more  EC 1998»
15 years 3 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
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