2168 search results - page 118 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
156
Voted
CONEXT
2005
ACM
15 years 5 months ago
2005
ACM
Random key Pre-distribution scheme has been proposed to overcome the memory, computation and energy limits of individual sensor in wireless sensor networks. In this scheme, a ring...
178
Voted
SIAMMAX
2011
14 years 6 months ago
2011
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
153
click to vote
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
173
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
135
click to vote
ESSLLI
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...