882 search results - page 111 / 177 » On the Hardness of Graph Isomorphism |
169
click to vote
FCT
2009
Springer
16 years 14 days ago
2009
Springer
Despite of their applicability betweennness constraints have (to the authorās knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
190
click to vote
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
161
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
165
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We present the Buļ¬er Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...