Sciweavers

2610 search results - page 290 / 522
» Computational Probabilistic Non-interference
Sort
View
TIT
2002
62views more  TIT 2002»
15 years 3 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
157
Voted
RC
2007
113views more  RC 2007»
15 years 3 months ago
A Search Algorithm for Calculating Validated Reliability Bounds
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
Fulvio Tonon
106
Voted
DSN
2000
IEEE
15 years 8 months ago
On the Quality of Service of Failure Detectors
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
Wei Chen, Sam Toueg, Marcos Kawazoe Aguilera
UAI
2000
15 years 5 months ago
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory and Model-Based Approach
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. Such systems leverage knowledge about the known preferenc...
David M. Pennock, Eric Horvitz, Steve Lawrence, C....
RECOMB
2004
Springer
16 years 4 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...