Sciweavers

874 search results - page 100 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 3 months ago
To Share or Not To Share?
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
PODC
2009
ACM
14 years 9 months ago
On a selfish caching game
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
Pietro Michiardi, Carla-Fabiana Chiasserini, Claud...
ICS
2010
Tsinghua U.
14 years 6 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
ICDCS
2009
IEEE
14 years 6 months ago
Centaur: A Hybrid Approach for Reliable Policy-Based Routing
In this paper, we consider the design of a policy-based routing system and the role that link state might play. Looking at the problem from a link-state perspective, we propose Ce...
Xin Zhang, Adrian Perrig, Hui Zhang
ICDCSW
2007
IEEE
14 years 3 months ago
Survey of Six Myths and Oversights about Distributed Hash Tables' Security
Distributed Hash Tables (DHT) was not designed to be secure against malicious users. But some secure systems like trust and reputation management algorithms trust DHT with their d...
Sylvain Dahan, Mitsuhisa Sato