2924 search results - page 304 / 585 » Lower Bounds in Distributed Computing |
138
click to vote
GI
2009
Springer
15 years 2 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...
151
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...
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
164
click to vote
ACL
2011
14 years 8 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...
143
click to vote
CHI
2011
ACM
14 years 8 months ago
2011
ACM
In this paper we investigate how people use online rating information to inform decision making. We examine whether a theory of searching for information to discriminate between a...