Sciweavers

925 search results - page 29 / 185
» Connectivity on Complete Lattices
Sort
View
ICRA
2010
IEEE
189views Robotics» more  ICRA 2010»
14 years 9 months ago
Discovering and mapping complete surfaces with stereo
This paper is about the automated discovery and mapping of surfaces using a stereo pair. We begin with the observation that for any workspace which is topologically connected (i.e....
Robert Shade, Paul Newman
SIAMAM
2008
170views more  SIAMAM 2008»
14 years 11 months ago
Absolute Stability and Complete Synchronization in a Class of Neural Fields Models
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
Olivier D. Faugeras, François Grimbert, Jea...
CONNECTION
2006
101views more  CONNECTION 2006»
14 years 12 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
PERCOM
2006
ACM
15 years 11 months ago
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
Kenneth A. Berman, Fred S. Annexstein, Aravind Ran...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...