6142 search results - page 198 / 1229 » The Complexity of Partition Functions |
88
Voted
COLING
1994
15 years 5 months ago
1994
This paper describes our work on parsing Turkish using the lexical-functional grammar formalism. This work represents the rst e ort for parsing Turkish. Our implementation is based...
138
Voted
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
123
Voted
CACM
2010
15 years 3 months ago
2010
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
126
Voted
AMC
2005
15 years 3 months ago
2005
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
112
Voted
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...