4903 search results - page 294 / 981 » The Set Covering Machine |
168
click to vote
ECML
2007
Springer
16 years 28 days ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
192
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
181
click to vote
DATE
2004
IEEE
2004
IEEE
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
15 years 10 months ago
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
182
click to vote
NIPS
2003
15 years 8 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
187
click to vote
EMNLP
2009
15 years 4 months ago
2009
Recently system combination has been shown to be an effective way to improve translation quality over single machine translation systems. In this paper, we present a simple and ef...