Sciweavers

875 search results - page 162 / 175
» A New Approach for Testing Properties of Discrete Distributi...
Sort
View
CCS
2008
ACM
15 years 2 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 2 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
WISEC
2010
ACM
15 years 5 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
BMCBI
2008
146views more  BMCBI 2008»
15 years 1 months ago
Rank-based edge reconstruction for scale-free genetic regulatory networks
Background: The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this proble...
Guanrao Chen, Peter Larsen, Eyad Almasri, Yang Dai
CIKM
2010
Springer
14 years 11 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang