Sciweavers

1015 search results - page 36 / 203
» The data locality of work stealing
Sort
View
BMVC
1998
15 years 7 months ago
A Method for Dynamic Clustering of Data
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...
Arnaldo J. Abrantes, Jorge S. Marques
ICRA
2010
IEEE
170views Robotics» more  ICRA 2010»
15 years 4 months ago
Robust vehicle localization in urban environments using probabilistic maps
— Autonomous vehicle navigation in dynamic urban environments requires localization accuracy exceeding that available from GPS-based inertial guidance systems. We have shown prev...
Jesse Levinson, Sebastian Thrun
NA
2008
92views more  NA 2008»
15 years 6 months ago
Computing bivariate splines in scattered data fitting and the finite-element method
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
Larry L. Schumaker
MOBICOM
2004
ACM
15 years 11 months ago
Practical robust localization over large-scale 802.11 wireless networks
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
Andreas Haeberlen, Eliot Flannery, Andrew M. Ladd,...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 6 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith