Sciweavers

362 search results - page 13 / 73
» A Theory of Probabilistic Functional Testing
Sort
View
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
15 years 9 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
CC
2008
Springer
131views System Software» more  CC 2008»
14 years 11 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
MANSCI
2006
122views more  MANSCI 2006»
14 years 11 months ago
Stochastic Dominance and Cumulative Prospect Theory
Second order stochastic dominance characterizes risk-averse preferences represented by expected utility. This paper supplies second order stochastic dominance conditions that char...
Manel Baucells, Franz H. Heukamp
CORR
2008
Springer
75views Education» more  CORR 2008»
14 years 11 months ago
Inductive and Coinductive Components of Corecursive Functions in Coq
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for c...
Yves Bertot, Ekaterina Komendantskaya
RSKT
2010
Springer
14 years 10 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou