4903 search results - page 114 / 981 » The Set Covering Machine |
TCS
2010
13 years 7 months ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
CSL
2006
Springer
13 years 9 months ago
2006
Springer
Enriching speech recognition output with sentence boundaries improves its human readability and enables further processing by downstream language processing modules. We have const...
JAR
2006
13 years 9 months ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Support vector machines are very accurate classifiers and have been widely used in many applications. However, the training and to a lesser extent prediction time of s...