Sciweavers

5 search results - page 1 / 1
» Orthogonal Layout with Optimal Face Complexity
Sort
View
ICPR
2002
IEEE
13 years 9 months ago
Face Recognition Using Optimal Non-Orthogonal Wavelet Basis Evaluated by Information Complexity
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of m...
Xiaoling Wang, Hairong Qi
CLUSTER
2001
IEEE
13 years 8 months ago
Clusterfile: A Flexible Physical Layout Parallel File System
This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. Existing parallel file systems offer little control over matc...
Florin Isaila, Walter F. Tichy
MOBIHOC
2003
ACM
14 years 3 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
AAAI
2006
13 years 5 months ago
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
Qijun Zhao, David Zhang, Hongtao Lu
PODC
2003
ACM
13 years 9 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...