2693 search results - page 261 / 539 » On Computing Complex Navigation Functions |
152
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
171
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
208
click to vote
JSAC
2007
15 years 6 months ago
2007
— A cross-layer packet scheduling scheme that streams pre-encoded video over wireless downlink packet access networks to multiple users is presented. The scheme can be used with ...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
171
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...