Sciweavers

4903 search results - page 95 / 981
» The Set Covering Machine
Sort
View
MST
2007
90views more  MST 2007»
13 years 8 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins
ISCIS
2003
Springer
14 years 2 months ago
Comparison of Feature Sets Using Multimedia Translation
Feature selection is very important for many computer vision applications. However, it is hard to find a good measure for the comparison. In this study, feature sets are compared ...
Pinar Duygulu, Özge Can Özcanli, Norman ...
IFIP
1993
Springer
14 years 1 months ago
Self-Timed Architecture of a Reduced Instruction Set Computer
An advanced Self-Timed Reduced Instruction Set Computer (ST-RISC) architecture is described. It is designed hierarchically, and is formally specified functionally at the various ...
Ilana David, Ran Ginosar, Michael Yoeli
ESANN
2008
13 years 10 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
SICHERHEIT
2010
13 years 7 months ago
A Malware Instruction Set for Behavior-Based Analysis
We introduce a new representation for monitored behavior of malicious software called Malware Instruction Set (MIST). The representation is optimized for effective and efficient a...
Philipp Trinius, Carsten Willems, Thorsten Holz, K...