Sciweavers

1243 search results - page 18 / 249
» On the locality of bounded growth
Sort
View
UAI
1997
13 years 9 months ago
Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...
Fabio Gagliardi Cozman
CADE
1992
Springer
13 years 11 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
ICML
2008
IEEE
14 years 8 months ago
The projectron: a bounded kernel-based Perceptron
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
Francesco Orabona, Joseph Keshet, Barbara Caputo
IANDC
2007
66views more  IANDC 2007»
13 years 7 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh
EOR
2008
84views more  EOR 2008»
13 years 7 months ago
On the dynamics of capital accumulation across space
We solve an optimal growth model in continuous space, continuous and bounded time. The optimizer chooses the optimal trajectories of capital and consumption across space and time ...
Carmen Camacho, Benteng Zou, Maya Briani