4502 search results - page 609 / 901 » Regular Model Checking |
163
click to vote
WIA
2007
Springer
16 years 23 days ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
195
click to vote
BROADNETS
2006
IEEE
16 years 22 days ago
2006
IEEE
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
185
click to vote
CRV
2006
IEEE
16 years 22 days ago
2006
IEEE
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
151
Voted
ICMCS
2006
IEEE
16 years 21 days ago
2006
IEEE
In this paper, we study the problem of the fast selection of video objects, as an aid for the efficient semi-automatic annotation of video programs. In a regular system, the user ...
176
click to vote
ICDAR
2005
IEEE
16 years 8 days ago
2005
IEEE
We present a document understanding system in which the arrangement of lines of text and block separators within a document are modeled by stochastic context free grammars. A gram...