5227 search results - page 256 / 1046 » Constructing New Media |
185
click to vote
ACL
1998
15 years 8 months ago
1998
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
209
click to vote
NETWORKING
2000
15 years 8 months ago
2000
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
165
click to vote
AML
2008
15 years 7 months ago
2008
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
159
Voted
EJC
2007
15 years 7 months ago
2007
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
204
click to vote
JCT
2007
15 years 7 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...