Sciweavers

60 search results - page 5 / 12
» Fast and Effective Procedure Inlining
Sort
View
ICDAR
2005
IEEE
14 years 1 months ago
Fast Vector Matching Methods and Their Applications to Handwriting Recognition
A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin L...
ISPD
2005
ACM
116views Hardware» more  ISPD 2005»
14 years 1 months ago
A fast algorithm for power grid design
This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an it...
Jaskirat Singh, Sachin S. Sapatnekar
CN
2006
82views more  CN 2006»
13 years 7 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
BMVC
1998
13 years 9 months ago
Automatic Face Representation and Classification
A working face recognition system requires the ability to represent facial images in such a way that permits efficient and accurate processing. The human visual system effectively...
Daniel B. Graham, Nigel M. Allinson
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan