Sciweavers

3630 search results - page 247 / 726
» Fast Marching Methods
Sort
View
ICPPW
2009
IEEE
16 years 1 months ago
Fast Autotuning Configurations of Parameters in Distributed Computing Systems Using Ordinal Optimization
Conventional autotuning configuration of parameters in distributed computing systems using evolutionary strategies increases integrated performance notably, though at the expense ...
Fan Zhang, Junwei Cao, Lianchen Liu, Cheng Wu
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
16 years 1 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz
IROS
2009
IEEE
200views Robotics» more  IROS 2009»
16 years 1 months ago
Fast geometric point labeling using conditional random fields
— In this paper we present a new approach for labeling 3D points with different geometric surface primitives using a novel feature descriptor – the Fast Point Feature Histogram...
Radu Bogdan Rusu, Andreas Holzbach, Nico Blodow, M...
MDM
2009
Springer
118views Communications» more  MDM 2009»
16 years 1 months ago
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haib...
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
16 years 1 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...