Sciweavers

3758 search results - page 236 / 752
» A Complete Subsumption Algorithm
Sort
View
CORR
1998
Springer
84views Education» more  CORR 1998»
15 years 6 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta
163
Voted
TCS
2010
15 years 4 months ago
Tight results for Next Fit and Worst Fit with resource augmentation
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
Joan Boyar, Leah Epstein, Asaf Levin
QEST
2010
IEEE
15 years 4 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
ICPR
2010
IEEE
15 years 3 months ago
Stereoscopic Image Inpainting: Distinct Depth Maps and Images Inpainting
In this paper we propose an algorithm for inpainting of stereo images. The issue is to reconstruct the holes in a pair of stereo image as if they were the projection of a 3D scene...
Alexandre Hervieu, Nicolas Papadakis, Aurél...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
15 years 1 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari