Sciweavers

6365 search results - page 154 / 1273
» Fast Local Computation Algorithms
Sort
View
APNOMS
2006
Springer
15 years 8 months ago
A DNS Based New Route Optimization Scheme with Fast Neighbor Discovery in Mobile IPv6 Networks
In this paper, we propose a new route optimization scheme (EDNS-MIPv6) for MIPv6 using the enhanced Domain Name System (DNS) together with local mobility management scheme to reduc...
Byungjoo Park, Haniph A. Latchman
MICCAI
2008
Springer
16 years 6 months ago
Fast Musculoskeletal Registration Based on Shape Matching
This paper presents a new method for computing elastic and plastic deformations in the context of discrete deformable model-based registration. Internal forces are estimated by ave...
Benjamin Gilles, Dinesh K. Pai
ICPR
2006
IEEE
16 years 6 months ago
Metric tree partitioning and Taylor approximation for fast support vector classification
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
Thang V. Pham, Arnold W. M. Smeulders
SMI
2010
IEEE
188views Image Analysis» more  SMI 2010»
15 years 3 months ago
Sharp Feature Detection in Point Clouds
—This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute...
Christopher Weber, Stefanie Hahmann, Hans Hagen
AGTIVE
2003
Springer
15 years 10 months ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....