1071 search results - page 153 / 215 » Theories of Automatic Structures and Their Complexity |
133
click to vote
STOC
2003
ACM
16 years 4 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...
132
click to vote
EUSFLAT
2007
15 years 5 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...
133
click to vote
POPL
2010
ACM
16 years 1 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...
142
click to vote
POPL
1998
ACM
15 years 8 months 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 ...
146
click to vote
BMCBI
2008
15 years 4 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...