1002 search results - page 94 / 201 » Towards Graph Programs for Graph Algorithms |
122
Voted
ICALP
1992
Springer
15 years 6 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
128
Voted
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
217
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Clio, the IBM Research system for expressing declarative schema mappings, has progressed in the past few years from a research prototype into a technology that is behind some of I...
152
Voted
ISDA
2009
IEEE
15 years 9 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
159
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...