1002 search results - page 117 / 201 » Towards Graph Programs for Graph Algorithms |
123
Voted
STACS
1991
Springer
15 years 6 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
133
Voted
PAAPP
2006
15 years 2 months ago
2006
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
141
click to vote
TOOLS
2000
IEEE
15 years 7 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...
222
Voted
POPL
2003
ACM
16 years 2 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
125
Voted
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...