Sciweavers

683 search results - page 22 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
TCS
1998
13 years 7 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
BMCBI
2007
144views more  BMCBI 2007»
13 years 7 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
DMIN
2006
125views Data Mining» more  DMIN 2006»
13 years 9 months ago
Privacy-Preserving Bayesian Network Learning From Heterogeneous Distributed Data
In this paper, we propose a post randomization technique to learn a Bayesian network (BN) from distributed heterogeneous data, in a privacy sensitive fashion. In this case, two or ...
Jianjie Ma, Krishnamoorthy Sivakumar
CORR
2008
Springer
157views Education» more  CORR 2008»
13 years 7 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
SRDS
2003
IEEE
14 years 1 months ago
Transparent Runtime Randomization for Security
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer