65 search results - page 9 / 13 » Lower Bounds for Lucas Chains |
JCT
2006
13 years 7 months ago
2006
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...
TCS
2008
13 years 7 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
ACL
2011
12 years 11 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...
ISTCS
1993
Springer
13 years 11 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...