2877 search results - page 292 / 576 » The Complexity of Planarity Testing |
164
click to vote
ACMSE
2006
ACM
16 years 24 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
162
click to vote
ASPDAC
2006
ACM
16 years 23 days ago
2006
ACM
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
178
click to vote
ISLPED
2006
ACM
16 years 23 days ago
2006
ACM
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
198
click to vote
ICDAR
2005
IEEE
16 years 12 days ago
2005
IEEE
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of th...
125
click to vote
ICMCS
2005
IEEE
16 years 12 days ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...