828 search results - page 131 / 166 » Simplicial Powers of Graphs |
CC
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a compiler technique that reduces the energy consumption of the memory subsystem, for an off-chip partitioned memory architecture having multiple memory banks ...
CTRSA
2007
Springer
14 years 1 months ago
2007
Springer
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
ESTIMEDIA
2007
Springer
14 years 1 months ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
ICAC
2006
IEEE
14 years 1 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...