849 search results - page 75 / 170 » Completely Non-malleable Schemes |
111
Voted
ITP
2010
15 years 4 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
89
Voted
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
79
Voted
LREC
2010
15 years 2 months ago
2010
In this paper, we describe our hybrid parsing model on Mandarin Chinese processing. The model combines the mainstream constitute and dependency parsing and the dataset we use it t...
103
Voted
AAAI
2004
15 years 2 months ago
2004
SenseClusters is a freely available word sense discrimination system that takes a purely unsupervised clustering approach. It uses no knowledge other than what is available in a r...
101
Voted
VMV
2001
15 years 2 months ago
2001
Sampling points with blue noise spectral characteristics are best suited for antialiasing. Compared to Poisson disk sampling, Lloyd's relaxation scheme yields samples that ap...