2924 search results - page 515 / 585 » Lower Bounds in Distributed Computing |
119
Voted
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
103
Voted
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
112
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
102
Voted
IWCMC
2006
ACM
15 years 8 months ago
2006
ACM
This paper explores the tracers deployment problem for IP traceback methods how many and where the tracers should be deployed in the network to be effective for locating the attac...
129
Voted
IWCMC
2006
ACM
15 years 8 months ago
2006
ACM
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...