Sciweavers

471 search results - page 42 / 95
» Single-peaked consistency and its complexity
Sort
View
CPAIOR
2007
Springer
14 years 1 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
LACL
1998
Springer
13 years 12 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
TIP
2008
138views more  TIP 2008»
13 years 7 months ago
Rotation-Invariant Texture Retrieval via Signature Alignment Based on Steerable Sub-Gaussian Modeling
This paper addresses the construction of a novel efficient rotation-invariant texture retrieval method that is based on the alignment in angle of signatures obtained via a steerabl...
George Tzagkarakis, Baltasar Beferull-Lozano, Pana...
PODS
2009
ACM
171views Database» more  PODS 2009»
14 years 8 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen