Sciweavers

1822 search results - page 273 / 365
» Risk-Sensitive Online Learning
Sort
View
ICDAR
2011
IEEE
12 years 7 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
AAAI
2012
11 years 10 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
ICML
2008
IEEE
14 years 8 months ago
Large scale manifold transduction
We show how the regularizer of Transductive Support Vector Machines (TSVM) can be trained by stochastic gradient descent for linear models and multi-layer architectures. The resul...
Michael Karlen, Jason Weston, Ayse Erkan, Ronan Co...
WWW
2009
ACM
14 years 8 months ago
Automated synthesis of composite services with correctness guarantee
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...
MLDM
2009
Springer
14 years 2 months ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...