12052 search results - page 437 / 2411 » computing 2010 |
148
click to vote
COLING
2010
15 years 1 months ago
2010
We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-r...
222
Voted
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
171
click to vote
CCCG
2010
15 years 8 months ago
2010
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
173
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
189
Voted
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.