8431 search results - page 64 / 1687 » Algorithmically Independent Sequences |
132
click to vote
COLOGNETWENTE
2007
15 years 3 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...
144
click to vote
ESORICS
2010
Springer
15 years 2 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...
116
click to vote
STOC
2004
ACM
16 years 2 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...
134
click to vote
ISCAS
2005
IEEE
15 years 7 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...
118
click to vote
ECML
2004
Springer
15 years 7 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...