Sciweavers

813 search results - page 103 / 163
» On the interaction between sharing and linearity
Sort
View
ICML
2009
IEEE
16 years 2 months ago
A stochastic memoizer for sequence data
We propose an unbounded-depth, hierarchical, Bayesian nonparametric model for discrete sequence data. This model can be estimated from a single training sequence, yet shares stati...
Frank Wood, Cédric Archambeau, Jan Gasthaus...
INFOCOM
2009
IEEE
15 years 8 months ago
Interference-Resilient Information Exchange
—This paper presents an efficient protocol to reliably exchange information in a single-hop radio network with unpredictable interference. The devices can access C communication...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...
INFOCOM
2005
IEEE
15 years 7 months ago
PIKE: peer intermediaries for key establishment in sensor networks
— The establishment of shared cryptographic keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of asymmetric key crypt...
Haowen Chan, Adrian Perrig
CSR
2008
Springer
15 years 3 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
WOB
2008
128views Bioinformatics» more  WOB 2008»
15 years 3 months ago
Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion
Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
Ximing Xu, David Sankoff