Sciweavers

2056 search results - page 73 / 412
» time 2000
Sort
View
COCOON
2001
Springer
15 years 4 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
ANLP
2000
96views more  ANLP 2000»
15 years 1 months ago
Efficient parsing strategies for syntactic analysis of closed captions
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
Krzysztof Czuba
MOC
1998
90views more  MOC 1998»
14 years 11 months ago
Numerical solution of parabolic integro-differential equations by the discontinuous Galerkin method
The numerical solution of a parabolic equation with memory is considered. The equation is first discretized in time by means of the discontinuous Galerkin method with piecewise co...
Stig Larsson, Vidar Thomée, Lars B. Wahlbin
LCTRTS
2000
Springer
15 years 3 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
MOC
1998
106views more  MOC 1998»
14 years 11 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan