986 search results - page 118 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
148
click to vote
ALGORITHMICA
2011
14 years 11 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...
162
click to vote
ACL
2011
14 years 7 months 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...
134
Voted
GI
2009
Springer
15 years 1 months ago
2009
Springer
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
130
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
129
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...