555 search results - page 55 / 111 » Decompositions of Grammar Constraints |
89
Voted
ICPR
2002
IEEE
15 years 5 months ago
2002
IEEE
In order to enable high-level semantics-based video annotation and interpretation, we tackle the problem of automatic decomposition of motion pictures into meaningful story units,...
101
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
124
click to vote
CONSTRAINTS
2006
15 years 22 days ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
113
Voted
VL
1999
IEEE
15 years 5 months ago
1999
IEEE
To take advantage of the ever-increasing volume of diagrams in electronic form, it is crucial that we have methods for parsing diagrams. Once a structured, content-based descripti...
105
Voted
ICDAR
1995
IEEE
15 years 4 months ago
1995
IEEE
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...