Sciweavers

6365 search results - page 43 / 1273
» Fast Local Computation Algorithms
Sort
View
95
Voted
BROADNETS
2004
IEEE
15 years 4 months ago
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
Murat Demirbas, Anish Arora, Vineet Mittal, Vinod ...
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
15 years 5 months ago
Simultaneous localization and mapping with unknown data association using fastSLAM
— The Extended Kalman Filter (EKF) has been the de facto approach to the Simultaneous Localization and Mapping (SLAM) problem for nearly fifteen years. However, the EKF has two ...
Michael Montemerlo, Sebastian Thrun
92
Voted
SIGGRAPH
1994
ACM
15 years 4 months ago
Fast contact force computation for nonpenetrating rigid bodies
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
David Baraff
94
Voted
ICIP
2008
IEEE
15 years 7 months ago
Exploiting local auto-correlation function for fast video to reference image alignment
Digital images of natural scenes are usually characterized by strong spatial correlation between adjacent pixels which has been successfully exploited in the coding of still and m...
Arif Mahmood, Sohaib Khan
115
Voted
IDA
2007
Springer
15 years 6 months ago
DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation
The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assign...
Alexander Hinneburg, Hans-Henning Gabriel