Sciweavers

292 search results - page 56 / 59
» Error Thresholds in Genetic Algorithms
Sort
View
SPW
2004
Springer
14 years 1 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
ICASSP
2011
IEEE
12 years 11 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
MOBICOM
2010
ACM
13 years 7 months ago
Indoor localization without the pain
While WiFi-based indoor localization is attractive, the need for a significant degree of pre-deployment effort is a key challenge. In this paper, we ask the question: can we perfo...
Krishna Chintalapudi, Anand Padmanabha Iyer, Venka...
BMCBI
2008
219views more  BMCBI 2008»
13 years 7 months ago
Classification of premalignant pancreatic cancer mass-spectrometry data using decision tree ensembles
Background: Pancreatic cancer is the fourth leading cause of cancer death in the United States. Consequently, identification of clinically relevant biomarkers for the early detect...
Guangtao Ge, G. William Wong