1404 search results - page 95 / 281 » Complexity of admissible rules |
EMNLP
2011
12 years 8 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
EVOW
2009
Springer
14 years 1 months ago
2009
Springer
This paper presents an evolutionary music software system that generates complex rhythmic polyphony in performance. A population of rhythms is derived from analysis of source mater...
COLING
1996
13 years 10 months ago
1996
The paper is a first attempt to fill a gap in the dependency literature, by providing a mathematical result on the complexity of recognition with a dependency grammar. The paper d...
EUC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We propose an access control scheme for developing authorization rules for XML documents, allowing flexible data granularity and authorization propagation. To simplify t...
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...