471 search results - page 39 / 95 » Single-peaked consistency and its complexity |
RE
2001
Springer
14 years 2 days ago
2001
Springer
at different levels of abstraction. There are two very different ways of using such languages. One approach is based on the manifestation of a single model, with construction of di...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
ISORC
2002
IEEE
14 years 17 days ago
2002
IEEE
Object-oriented, concurrent, and event-based programming models provide a natural framework in which to express the behavior of distributed and embedded software systems. However,...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
The tree of shapes is a powerful tool for image representation which holds many interesting properties. There are many works in the literature that use it for image segmentation, ...