1071 search results - page 79 / 215 » Programming with enumerable sets of structures |
167
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
134
click to vote
VL
2003
IEEE
15 years 10 months ago
2003
IEEE
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
140
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
138
click to vote
ICGI
2004
Springer
15 years 10 months ago
2004
Springer
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
292
click to vote
Book
"This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of ...