Sciweavers

2801 search results - page 239 / 561
» On the Adequateness of the Connection Method
Sort
View
COLT
2008
Springer
15 years 8 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin
ESANN
2008
15 years 8 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
CAINE
2003
15 years 8 months ago
Analysis Tool for Honeypot Systems
The increased utilization of the Internet and the larger number of computers connected to it has brought up a significant security problem. Hackers or crackers have attacked compu...
Terry Griffin
PRIS
2003
15 years 8 months ago
Numerical Field Extraction in Handwritten Incoming Mail Documents
In this communication, we propose a method for the automatic extraction of numerical fields in handwritten documents. The approach exploits the known syntactic structure of the num...
Guillaume Koch, Laurent Heutte, Thierry Paquet
IJCAI
1997
15 years 8 months ago
Let's Plan It Deductively!
The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
Wolfgang Bibel