Sciweavers

3131 search results - page 373 / 627
» Generalized connection caching
Sort
View
FOCS
2006
IEEE
16 years 22 days ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
16 years 8 days ago
Sensor-based Planning for Planar Multi-Convex Rigid Bodies
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
Ji Yeong Lee, Howie Choset
SASN
2005
ACM
16 years 6 days ago
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment
Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Rec...
Takashi Ito, Hidenori Ohta, Nori Matsuda, Takeshi ...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
16 years 5 days ago
Evolutionary form-finding of tensegrity structures
Tensegrity structures are stable 3-dimensional mechanical structures which maintain their form due to an intricate balance of forces between disjoint rigid elements and continuous...
Chandana Paul, Hod Lipson, Francisco J. Valero Cue...
WCC
2005
Springer
115views Cryptology» more  WCC 2005»
16 years 4 days ago
On the Weights of Binary Irreducible Cyclic Codes
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
Yves Aubry, Philippe Langevin