Sciweavers

1390 search results - page 95 / 278
» Computing the depth of a flat
Sort
View
BIRTHDAY
2006
Springer
15 years 1 months ago
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
Helmut Seidl, Kumar Neeraj Verma
SMILE
2000
Springer
15 years 1 months ago
A Compact Model for Viewpoint Dependent Texture Synthesis
A texture synthesis method is presented that generates similar texture from an example image. It is based on the emulation of simple but rather carefully chosen image intensity sta...
Alexey Zalesny, Luc J. Van Gool
CONCUR
2010
Springer
14 years 11 months ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
ACL
2010
14 years 8 months ago
Fine-Grained Genre Classification Using Structural Learning Algorithms
Prior use of machine learning in genre classification used a list of labels as classification categories. However, genre classes are often organised into hierarchies, e.g., coveri...
Zhili Wu, Katja Markert, Serge Sharoff
CORR
2007
Springer
106views Education» more  CORR 2007»
14 years 10 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos