4722 search results - page 532 / 945 » Representation-independent program analysis |
143
click to vote
ICALP
2007
Springer
16 years 27 days ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
217
click to vote
MFCS
2005
Springer
16 years 7 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
163
click to vote
ICPP
1996
IEEE
15 years 11 months ago
1996
IEEE
This paper presents the design and preliminary implementation of MpPVM, a software system that supports process migration for PVM application programs in a non-dedicated heterogen...
175
click to vote
GD
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
162
click to vote
ICFEM
2000
Springer
15 years 10 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...