4403 search results - page 654 / 881 » Galois Theory of Algorithms |
319
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
310
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
207
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...
368
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
302
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...