2436 search results - page 293 / 488 » Comonadic Notions of Computation |
184
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
218
click to vote
AISB
2008
Springer
15 years 8 months ago
2008
Springer
Philosophy, artificial intelligence and cognitive science have long been dominated by the presupposition that intelligence is fundamentally individual. Recent work in cognitive sci...
177
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
212
click to vote
NIPS
2001
15 years 8 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
186
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...