777 search results - page 96 / 156 » A fast algorithm for the computation of an upper bound on th... |
SP
2002
IEEE
13 years 8 months ago
2002
IEEE
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
ALGORITHMICA
2011
13 years 4 months ago
2011
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 diffe...
ACL
2011
13 years 18 days ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
TAMC
2010
Springer
13 years 7 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...