12183 search results - page 409 / 2437 » Computers under Attacks! |
179
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
205
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
192
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
231
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
191
click to vote
MOBISYS
2008
ACM
15 years 9 months ago
2008
ACM
Kimberley enables rapid software provisioning of fixed infrastructure for transient use by a mobile device. It uses virtual machine (VM) technology, but avoids the performance cha...