Sciweavers

2490 search results - page 356 / 498
» The Generalized Theory of Model Preference
Sort
View
RECOMB
2003
Springer
16 years 4 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 4 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
16 years 4 months ago
M-invariance: towards privacy preserving re-publication of dynamic datasets
The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-pu...
Xiaokui Xiao, Yufei Tao
MOBIHOC
2008
ACM
16 years 3 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
QEST
2005
IEEE
15 years 9 months ago
QBDs with Marked Time Epochs: a Framework for Transient Performance Measures
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
Benny Van Houdt, Chris Blondia