Sciweavers

2661 search results - page 298 / 533
» Quantum Complexity Classes
Sort
View
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
LFCS
2007
Springer
15 years 10 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
PKDD
2007
Springer
130views Data Mining» more  PKDD 2007»
15 years 10 months ago
Discovering Emerging Patterns in Spatial Databases: A Multi-relational Approach
Abstract. Spatial Data Mining (SDM) has great potential in supporting public policy and in underpinning society functioning. One task in SDM is the discovery of characterization an...
Michelangelo Ceci, Annalisa Appice, Donato Malerba
SOFSEM
2007
Springer
15 years 10 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
VMCAI
2007
Springer
15 years 10 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif