539 search results - page 72 / 108 » An Improved Upper Bound for SAT |
ACL
1996
13 years 9 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
GD
2008
Springer
13 years 8 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper we consider a cooperative network that is trying to reach binary consensus over fading channels. We first characterize the impact of fading on network consensus by up...
FUIN
2006
13 years 7 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
JGT
2008
13 years 7 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...