Sciweavers

1507 search results - page 65 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
ICDAR
2003
IEEE
14 years 3 months ago
Study of the Consistency of Some Discriminatory Features Used by Document Examiners in the Analysis of Handwritten Letter 'a'
In this paper a study of some structural features of handwritten letter ‘a’ is presented. The features under consideration are structural, style and formation features documen...
Philip Jonathan Sutanto, Graham Leedham, Vladimir ...
ICCS
2007
Springer
14 years 1 months ago
Discovering Latent Structures: Experience with the CoIL Challenge 2000 Data Set
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
Nevin Lianwen Zhang
IANDC
2008
120views more  IANDC 2008»
13 years 10 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
NIPS
2001
13 years 11 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
ECAI
2006
Springer
14 years 1 months ago
Verifying Interlevel Relations Within Multi-Agent Systems
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...
Alexei Sharpanskykh, Jan Treur