Sciweavers

461 search results - page 76 / 93
» Higher Kurtz randomness
Sort
View
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
14 years 11 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
ISMB
1996
14 years 11 months ago
A Knowledge-Based Method for Protein Structure Refinement and Prediction
The native conformation of a protein, in a given environment, is determined entirely by the various interatomic interactions dictated by the amino acid sequence (1-3). We describe...
Shankar Subramaniam, David K. Tcheng, James M. Fen...
ATAL
2009
Springer
14 years 10 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
BMCBI
2010
152views more  BMCBI 2010»
14 years 9 months ago
Apples and oranges: avoiding different priors in Bayesian DNA sequence analysis
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
Jens Keilwagen, Jan Grau, Stefan Posch, Ivo Grosse