Sciweavers

7930 search results - page 1244 / 1586
» Greedy in Approximation Algorithms
Sort
View
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
15 years 4 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
180
Voted
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
15 years 1 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
ECCC
2011
205views ECommerce» more  ECCC 2011»
15 years 1 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
ICASSP
2011
IEEE
14 years 10 months ago
Asymptotically MMSE-optimum pilot design for comb-type OFDM channel estimation in high-mobility scenarios
Under high mobility, the orthogonality between sub-carriers in an OFDM symbol is destroyed resulting in severe intercarrier interference (ICI). We present a novel algorithm to est...
K. M. Zahidul Islam, Tareq Y. Al-Naffouri, Naofal ...
AAAI
2011
14 years 6 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
« Prev « First page 1244 / 1586 Last » Next »