Sciweavers

17688 search results - page 86 / 3538
» Data Set Balancing
Sort
View
ISHPC
2000
Springer
15 years 6 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 9 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou
INFOCOM
2006
IEEE
15 years 9 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
ICRA
2008
IEEE
297views Robotics» more  ICRA 2008»
15 years 9 months ago
Fast 3D reconstruction of human shape and motion tracking by parallel fast level set method
— This paper presents a parallel algorithm of the Level Set Method named the Parallel Fast Level Set Method, and its application for real-time 3D reconstruction of human shape an...
Yumi Iwashita, Ryo Kurazume, Kenji Hara, Seiichi U...
IJRR
2010
112views more  IJRR 2010»
15 years 1 months ago
On the Passive Force Closure Set of Planar Grasps and Fixtures
This paper considers grasps and fixtures whose contacts react according to force-displacement laws consistent with friction constrains at the contacts. The passive force closure s...
Amir Shapiro, Elon Rimon, Shraga Shoval