216 search results - page 18 / 44 » From Constraints to Finite Automata to Filtering Algorithms |
JMLR
2008
13 years 8 months ago
2008
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
ICDAR
1995
IEEE
14 years 3 hour 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...
CP
2009
Springer
14 years 9 months ago
2009
Springer
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
JIIS
2008
13 years 8 months ago
2008
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
CP
2009
Springer
14 years 9 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...