131 search results - page 17 / 27 » The Complexity of Online Memory Checking |
JMLR
2008
14 years 9 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
ENTCS
2002
14 years 9 months ago
2002
Runtime verification permits checking system properties that cannot be fully verified off-line. This is particularly true when the system includes complex third-party components, ...
AAI
2008
14 years 9 months ago
2008
We present a novel hybrid technique for improving the predictive performance of an online Machine Learning system: Combining advantages from both memory based and concept based pr...