Sciweavers

1659 search results - page 124 / 332
» From Functional Analysis to Iterative Methods
Sort
View
124
Voted
AML
2008
124views more  AML 2008»
15 years 2 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
LICS
1998
IEEE
15 years 6 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
EOR
2007
101views more  EOR 2007»
15 years 2 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
160
Voted
CGF
2010
141views more  CGF 2010»
14 years 12 months ago
A Survey of Procedural Noise Functions
Procedural noise functions are widely used in Computer Graphics, from off-line rendering in movie production to interactive video games. The ability to add complex and intricate d...
Ares Lagae, Sylvain Lefebvre, R. Cook, T. DeRose, ...
JUCS
2002
120views more  JUCS 2002»
15 years 2 months ago
Instance Cooperative Memory to Improve Query Expansion in Information Retrieval Systems
The main goal of this research is to improve Information Retrieval Systems by enabling them to generate search outcomes that are relevant and customized to each specific user. Our ...
Lobna Jeribi, Béatrice Rumpler