384 search results - page 24 / 77 » Equivalence Relations on Classes of Computable Structures |
DAM
1999
13 years 7 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
DBPL
1991
Springer
13 years 11 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
CAV
2001
Springer
14 years 6 days ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
CCGRID
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
The visual world demonstrates organized spatial patterns,
among objects or regions in a scene, object-parts
in an object, and low-level features in object-parts. These
classes o...