Sciweavers

3001 search results - page 244 / 601
» Recursive type generativity
Sort
View
AISC
2006
Springer
15 years 10 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu
UAI
1997
15 years 7 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
ICDE
2010
IEEE
195views Database» more  ICDE 2010»
15 years 6 months ago
Advances in constrained clustering
— Constrained clustering (semi-supervised learning) techniques have attracted more attention in recent years. However, the commonly used constraints are restricted to the instanc...
ZiJie Qi, Yinghui Yang
FAC
2008
64views more  FAC 2008»
15 years 6 months ago
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...
Robert M. Hierons, Florentin Ipate
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 6 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...