141 search results - page 14 / 29 » Layout Problems on Lattice Graphs |
ICPP
1999
IEEE
14 years 2 months ago
1999
IEEE
There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However,...
ISCAS
1994
IEEE
14 years 1 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
ICCV
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
DCC
2011
IEEE
13 years 4 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
ICFCA
2005
Springer
14 years 3 months ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...