Sciweavers

12289 search results - page 2183 / 2458
» computing 2006
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 4 months ago
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
Yakir Reshef, Salil P. Vadhan
COR
2008
67views more  COR 2008»
15 years 4 months ago
Selecting compact habitat reserves for species with differential habitat size needs
We propose a model for the design of protected habitat reserves, which maximizes the number of species represented at least once in a limited set of reserved sites or parcels. Mos...
Vladimir Marianov, Charles S. Revelle, Stephanie S...
AAECC
2006
Springer
125views Algorithms» more  AAECC 2006»
15 years 4 months ago
Combinatorial Group Theory and Public Key Cryptography
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
Vladimir Shpilrain, Gabriel Zapata
ADHOC
2006
113views more  ADHOC 2006»
15 years 4 months ago
Positioning using local maps
ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new ...
Yi Shang, Wheeler Ruml, Markus P. J. Fromherz
AI
2006
Springer
15 years 4 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
« Prev « First page 2183 / 2458 Last » Next »