5608 search results - page 159 / 1122 » On the Theory of Matchgate Computations |
100
click to vote
CONCURRENCY
2007
15 years 1 months ago
2007
We discuss the design and high-performance implementation of collective communications operations on distributed-memory computer architectures. Using a combination of known techni...
111
click to vote
JCB
2007
15 years 1 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
DAC
2009
ACM
16 years 2 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
FCT
2009
Springer
15 years 8 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
114
click to vote
SIGCSE
2008
ACM
15 years 1 months ago
2008
ACM
Inclusive education is the practice of making sure that all students of all abilities have positive learning experiences. The study presented in this paper explores the current st...