5995 search results - page 986 / 1199 » Algorithmic Game Theory |
129
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
241
click to vote
POPL
2006
ACM
16 years 5 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...
237
click to vote
POPL
2005
ACM
16 years 5 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...
142
click to vote
RECOMB
2003
Springer
16 years 5 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...
272
Voted
SIGMOD
2009
ACM
16 years 4 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...