Sciweavers

6881 search results - page 307 / 1377
» Motivation
Sort
View
APLAS
2006
ACM
16 years 22 days ago
Widening Polyhedra with Landmarks
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequen...
Axel Simon, Andy King
CF
2006
ACM
16 years 22 days ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
CONEXT
2006
ACM
16 years 21 days ago
Understanding the behavior of TCP for real-time CBR workloads
In this paper, we examine the feasibility of sending real-time CBR workloads over TCP. This is motivated by the friendliness of NATs and firewalls towards TCP as opposed to UDP a...
Salman Baset, Eli Brosh, Vishal Misra, Dan Rubenst...
NETGAMES
2006
ACM
16 years 21 days ago
A practical pricing model of inter-domain multicasting based on game theory
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...
Jinjing Zhao, Peidong Zhu, Xicheng Lu, Feng Zhao
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 21 days ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin