Sciweavers

142 search results - page 13 / 29
» An Experimental Comparison of Symbolic and Connectionist Lea...
Sort
View
ECML
2007
Springer
15 years 3 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
IWCLS
2007
Springer
15 years 3 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
FUIN
2006
98views more  FUIN 2006»
14 years 9 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
88
Voted
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 1 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
81
Voted
ICDCS
2007
IEEE
15 years 4 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee