Sciweavers

2695 search results - page 142 / 539
» The Complexity of Forecast Testing
Sort
View
INTERFACES
2010
211views more  INTERFACES 2010»
15 years 2 months ago
HP Transforms Product Portfolio Management with Operations Research
:  HP Transforms Product Portfolio Management with Operations Research Julie Ward, Bin Zhang, Shailendra Jain, Chris Fry, Thomas Olavson, Holger Mishal, Jason Amaral, Dirk Beyer...
Julie Ward, Bin Zhang, Shailendra Jain, Chris Fry,...
CIE
2006
Springer
15 years 8 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
15 years 4 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
PRL
2008
88views more  PRL 2008»
15 years 4 months ago
Time-efficient spam e-mail filtering using n-gram models
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...
Ali Çiltik, Tunga Güngör
DAC
2003
ACM
16 years 5 months ago
A scalable software-based self-test methodology for programmable processors
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...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...