Sciweavers

1094 search results - page 38 / 219
» On Computing Explanations in Argumentation
Sort
View
ISMB
1998
15 years 17 hour ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
CICLING
2006
Springer
15 years 19 days ago
Enriching Wordnets with New Relations and with Event and Argument Structures
Abstract. This paper argues that wordnets, being concept-based computational lexica, should include information on event and argument structures. This general approach is relevant ...
Raquel Amaro, Rui Pedro Chaves, Palmira Marrafa, S...
ICDS
2008
IEEE
15 years 5 months ago
Security Arguments for a Class of ID-Based Signatures
Zhengwei Guo, Xinzheng He, Baocheng Xun

Tutorial
6794views
16 years 11 months ago
Fast Marching Methods
Detailed explanation of the Fast Marching Methods, which can be used to efficiently solve the Eikonal equation that models moving interfaces whose motion is either monotonically in...
M. Sabry Hassouna
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 2 months ago
A Note on Learning and Evolution in Neural Networks
Interactions between evolution and lifetime learning are of great interest to studies of adaptive behaviour both in the natural world and the field of evolutionary computation. Th...
Brian Carse, Johan Oreland