8431 search results - page 64 / 1687 » Algorithmically Independent Sequences |
COLOGNETWENTE
2007
14 years 11 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
104
click to vote
ESORICS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract We propose an approach to certify the information flow security of multi-threaded programs independently from the scheduling algorithm. A scheduler-independent verificatio...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
— In the context of Independent Component Analysis (ICA), we propose a simple method for online estimation of activation functions in order to blindly separate instantaneous mixt...
ECML
2004
Springer
15 years 3 months ago
2004
Springer
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...