Sciweavers

6251 search results - page 145 / 1251
» Randomness, Computability, and Density
Sort
View
IPSN
2005
Springer
15 years 9 months ago
Experiences and directions in pushpin computing
— Over the last three years we have built and experimented with the Pushpin Computing wireless sensor network platform. The Pushpin platform is a tabletop multihop wireless senso...
Joshua Lifton, Michael Broxton, Joseph A. Paradiso
JCNS
2010
103views more  JCNS 2010»
14 years 10 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
IJDMB
2010
128views more  IJDMB 2010»
15 years 1 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
DCG
1998
59views more  DCG 1998»
15 years 3 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata