Sciweavers

1405 search results - page 1 / 281
» Popularity at Minimum Cost
Sort
View
68
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 8 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
15 years 3 months ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert
3DIM
2001
IEEE
15 years 1 months ago
A Laser Range Scanner Designed for Minimum Calibration Complexity
Laser range scanners are a popular method for acquiring three-dimensional geometry due to their accuracy and robustness. Maximizing scanner accuracy while minimizing engineering c...
James Davis, Xing Chen
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
15 years 6 months ago
I/O Clustering in Design Cost and Performance Optimization for Flip-Chip Design
I/O placement has always been a concern in modern IC design. Due to flip-chip technology, I/O can be placed throughout the whole chip without long wires from the periphery of the...
Hung-Ming Chen, I-Min Liu, Martin D. F. Wong, Muzh...
CVPR
2010
IEEE
14 years 8 months ago
Cost-Sensitive Subspace Learning for Face Recognition
Conventional subspace learning-based face recognition aims to attain low recognition errors and assumes same loss from all misclassifications. In many real-world face recognition...
Jiwen Lu, Tan Yap-Peng