Sciweavers

21324 search results - page 4172 / 4265
» Making the case for computing
Sort
View
TAMC
2007
Springer
16 years 11 days ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
16 years 11 days ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
16 years 10 days ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
ECRTS
2006
IEEE
16 years 9 days ago
WCET-Centric Software-controlled Instruction Caches for Hard Real-Time Systems
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
Isabelle Puaut
ICPADS
2006
IEEE
16 years 8 days ago
Destination-Based HoL Blocking Elimination
Congestion management is likely to become a critical issue in interconnection networks, as increasing power consumption and cost concerns will lead to the use of smaller networks....
T. Nachiondo, Jose Flich, José Duato
« Prev « First page 4172 / 4265 Last » Next »