88 search results - page 14 / 18 » A new approach to dynamic all pairs shortest paths |
106
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
132
click to vote
BMCBI
2002
14 years 11 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
CEE
2007
14 years 11 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
116
click to vote
CHINZ
2008
ACM
15 years 1 months ago
2008
ACM
As performance gains in automatic speech recognition systems plateau, improvements to existing applications of speech recognition technology seem more likely to come from better u...
125
click to vote
COLING
2008
15 years 1 months ago
2008
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...