Sciweavers

1728 search results - page 280 / 346
» The Accelerated Euclidean Algorithm
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
MDM
2009
Springer
150views Communications» more  MDM 2009»
16 years 1 months ago
Perimeter-Based Data Replication in Mobile Sensor Networks
—This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting spatio-temporal ev...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, M...
IROS
2008
IEEE
108views Robotics» more  IROS 2008»
16 years 28 days ago
A random set formulation for Bayesian SLAM
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
John Mullane, Ba-Ngu Vo, Martin David Adams, Wijer...
CIKM
2007
Springer
16 years 21 days ago
Regularized locality preserving indexing via spectral regression
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He, Wei Vivian Zhang, Jiawei Han
EUROCRYPT
2005
Springer
16 years 1 days ago
Floating-Point LLL Revisited
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
Phong Q. Nguyen, Damien Stehlé