Sciweavers

417 search results - page 12 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 11 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
TIT
2002
129views more  TIT 2002»
13 years 7 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
BMCBI
2007
105views more  BMCBI 2007»
13 years 7 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
CCR
2008
88views more  CCR 2008»
13 years 7 months ago
My ten favorite "practical theory" papers
As the saying goes, "In theory there is no difference between theory and practice. But, in practice, there is." Networking research has a wealth of good papers on both s...
Jennifer Rexford
MOC
2000
124views more  MOC 2000»
13 years 7 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou