Sciweavers

3134 search results - page 64 / 627
» Computing full disjunctions
Sort
View
SAC
2006
ACM
14 years 3 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
CPM
2004
Springer
145views Combinatorics» more  CPM 2004»
14 years 3 months ago
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs
The perfect phylogeny model for haplotype evolution has been successfully applied to haplotype resolution from genotype data. In this study we explore the application of the perfe...
Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, It...
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 5 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
ICML
2005
IEEE
14 years 10 months ago
Tempering for Bayesian C&RT
This paper concerns the experimental assessment of tempering as a technique for improving Bayesian inference for C&RT models. Full Bayesian inference requires the computation ...
Nicos Angelopoulos, James Cussens
DAGM
2000
Springer
14 years 2 months ago
Structured Covariance Matrices for Statistical Image Object Recognition
Abstract. In this paper we present di erent approaches to structuring covariance matrices within statistical classi ers. This is motivated by the fact that the use of full covarian...
Jörg Dahmen, Daniel Keysers, Michael Pitz, He...