523 search results - page 95 / 105 » Decidability of string graphs |
97
Voted
TOOLS
2000
IEEE
15 years 1 months ago
2000
IEEE
The research presented here addresses the problem of change impact analysis CIA for object-oriented software. A major problem for developers in an evolutionary environment is th...
ECOOP
1997
Springer
15 years 1 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
ECAI
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
SGP
2004
14 years 12 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
COCO
2008
Springer
14 years 11 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...