1002 search results - page 154 / 201 » Towards Graph Programs for Graph Algorithms |
142
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
231
click to vote
LCC
1994
15 years 6 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
123
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and soci...
136
click to vote
DIALM
2007
ACM
15 years 6 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
126
click to vote
ICSE
2007
IEEE-ACM
16 years 2 months ago
2007
IEEE-ACM
As aspect-oriented software development gains popularity, there is growing interest in using aspects to implement cross-cutting concerns in object-oriented systems. When aspect-or...