9842 search results - page 1755 / 1969 » The Complexity of the Matching-Cut Problem |
126
click to vote
ICCSA
2009
Springer
15 years 10 months ago
2009
Springer
Data aggregation in Geographic Information Systems (GIS) is a desirable feature, spatial data are integrated in OLAP engines for this purpose. However, the development and operatio...
136
click to vote
ICFCA
2009
Springer
15 years 10 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
132
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
129
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
141
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...