1071 search results - page 153 / 215 » Theories of Automatic Structures and Their Complexity |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
EUSFLAT
2007
13 years 9 months ago
2007
The recent advances in the research of left-continuous t-norms is summarized in this talk. The main focus is on construction methods, geometric description, and structural charact...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
POPL
1998
ACM
14 years 11 days ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
BMCBI
2008
13 years 8 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...