Sciweavers

1746 search results - page 113 / 350
» A linear implementation of PACMAN
Sort
View
IOR
2007
82views more  IOR 2007»
13 years 9 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
MOC
1998
126views more  MOC 1998»
13 years 9 months ago
Implicit-explicit multistep finite element methods for nonlinear parabolic problems
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
Georgios Akrivis, Michel Crouzeix, Charalambos Mak...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
IAJIT
2011
13 years 4 months ago
Blocked-based sparse matrix-vector multiplication on distributed memory parallel computers
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
Rukhsana Shahnaz, Anila Usman
EUROCRYPT
2012
Springer
11 years 11 months ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart