Sciweavers

12659 search results - page 2413 / 2532
» The distributed breakout algorithms
Sort
View
VEE
2009
ACM
172views Virtualization» more  VEE 2009»
15 years 11 months ago
Entropy: a consolidation manager for clusters
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...
Fabien Hermenier, Xavier Lorca, Jean-Marc Menaud, ...
CCS
2009
ACM
15 years 11 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
CCS
2009
ACM
15 years 11 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
CCS
2009
ACM
15 years 11 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
FPGA
2009
ACM
159views FPGA» more  FPGA 2009»
15 years 11 months ago
Choose-your-own-adventure routing: lightweight load-time defect avoidance
Aggressive scaling increases the number of devices we can integrate per square millimeter but makes it increasingly difficult to guarantee that each device fabricated has the inte...
Raphael Rubin, André DeHon
« Prev « First page 2413 / 2532 Last » Next »