Sciweavers

10568 search results - page 495 / 2114
» Computer Intelligence and Formalization
Sort
View
LFCS
2009
Springer
15 years 11 months ago
Decidability and Undecidability in Probability Logic
We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas ...
Sebastiaan Terwijn
151
Voted
TSP
2010
14 years 11 months ago
Barankin-type lower bound on multiple change-point estimation
We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cram
Patricio S. La Rosa, Alexandre Renaux, Carlos H. M...
164
Voted
ASM
2010
ASM
15 years 8 months ago
Starting B Specifications from Use Cases
The B method is one of the most used formal methods, when reactive systems is under question, due to good support for refinement. However, obtaining the formal model from requireme...
Thiago C. de Sousa, Aryldo G. Russo
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
16 years 6 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
IDTRUST
2010
ACM
15 years 12 months ago
Computational techniques for increasing PKI policy comprehension by human analysts
Natural-language policies found in X.509 PKI describe an organization’s stated policy as a set of requirements for trust. The widespread use of X.509 underscores the importance ...
Gabriel A. Weaver, Scott A. Rea, Sean W. Smith