2877 search results - page 167 / 576 » The Complexity of Planarity Testing |
127
click to vote
AAECC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
139
click to vote
PRL
2008
15 years 4 months ago
2008
In this paper, we propose spam e-mail filtering methods having high accuracies and low time complexities. The methods are based on the n-gram approach and a heuristics which is re...
135
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
146
click to vote
CSMR
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Building comprehensive test suites for web applications poses new challenges in software testing. Coverage criteria used for traditional systems to assess the quality of ...
119
click to vote
ISPD
2000
ACM
15 years 8 months ago
2000
ACM
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...