Sciweavers

6365 search results - page 5 / 1273
» Fast Local Computation Algorithms
Sort
View
ACIVS
2008
Springer
13 years 11 months ago
A Fast and Fully Automatic Ear Recognition Approach Based on 3D Local Surface Features
Sensitivity of global features to pose, illumination and scale variations encouraged researchers to use local features for object representation and recognition. Availability of 3D...
Syed M. S. Islam, Rowan Davies, Ajmal S. Mian, Moh...
INFOCOM
2008
IEEE
14 years 4 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
ICPR
2010
IEEE
13 years 11 months ago
Local Rotation Invariant Patch Descriptors for 3D Vector Fields
In this paper, we present two novel methods for the fast computation of local rotation invariant patch descriptors for 3D vectorial data. Patch based algorithms have recently becom...
Fehr Janis
NDSS
1998
IEEE
14 years 2 months ago
Distributed Algorithms for Attack Localization in All-Optical Networks
All-Optical Networks provide ultra-fast data rates, but present a new set of challenges for network security. We present a new algorithm for attack localization in networks. The a...
Ruth Bergman, Muriel Médard, Serena Chan
ICPR
2010
IEEE
14 years 4 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly