2252 search results - page 300 / 451 » Lower Bounds for Dynamic Algorithms |
155
Voted
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...
131
Voted
WABI
2009
Springer
15 years 10 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
108
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
125
Voted
WWW
2004
ACM
16 years 4 months ago
2004
ACM
The emerging Service-Oriented Computing (SOC) paradigm promises to enable businesses and organizations to collaborate in an unprecedented way by means of standard web services. To...
134
click to vote
PPOPP
2010
ACM
16 years 23 days ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...