Sciweavers

996 search results - page 123 / 200
» Generalised Kernel Machines
Sort
View
JCP
2006
102views more  JCP 2006»
13 years 8 months ago
Efficient Formulations for 1-SVM and their Application to Recommendation Tasks
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
Yasutoshi Yajima, Tien-Fang Kuo
JMM2
2007
148views more  JMM2 2007»
13 years 8 months ago
Object Segmentation Using Background Modelling and Cascaded Change Detection
— The automatic extraction and analysis of visual information is becoming generalised. The first step in this processing chain is usually separating or segmenting the captured v...
Luís Filipe Teixeira, Jaime S. Cardoso, Lu&...
B
2007
Springer
14 years 3 months ago
Modelling and Proof Analysis of Interrupt Driven Scheduling
Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We ...
Bill Stoddart, Dominique Cansell, Frank Zeyda
RTA
2010
Springer
14 years 22 days ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ACL
2003
13 years 10 months ago
Syntactic Features and Word Similarity for Supervised Metonymy Resolution
We present a supervised machine learning algorithm for metonymy resolution, which exploits the similarity between examples of conventional metonymy. We show that syntactic head-mo...
Malvina Nissim, Katja Markert