Sciweavers

4007 search results - page 436 / 802
» Computation with imprecise probabilities
Sort
View
160
Voted
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
15 years 6 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
COR
2006
112views more  COR 2006»
15 years 6 months ago
A continuous approach to considering uncertainty in facility design
This paper presents a formulation of the facilities block layout problem which explicitly considers uncertainty in material handling costs on a continuous scale by use of expected...
Bryan A. Norman, Alice E. Smith
CVIU
2006
76views more  CVIU 2006»
15 years 6 months ago
Homeostatic image perception: An artificial system
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
Thomas Feldman, Laurent Younes
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
15 years 6 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
136
Voted
CSDA
2007
94views more  CSDA 2007»
15 years 6 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen