Sciweavers

6365 search results - page 2 / 1273
» Fast Local Computation Algorithms
Sort
View
RSS
2007
134views Robotics» more  RSS 2007»
13 years 7 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
SECURWARE
2008
IEEE
13 years 12 months ago
Fast Algorithms for Local Inconsistency Detection in Firewall ACL Updates
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
13 years 11 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
TIT
2008
103views more  TIT 2008»
13 years 5 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
TCSV
2008
195views more  TCSV 2008»
13 years 5 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...