3267 search results - page 134 / 654 » Generalized quasirandom graphs |
157
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
168
click to vote
MOBIHOC
2012
ACM
13 years 7 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
214
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
173
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
143
Voted
WABI
2007
Springer
15 years 10 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...