2924 search results - page 335 / 585 » Lower Bounds in Distributed Computing |
158
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
150
click to vote
RTCSA
2007
IEEE
16 years 27 days ago
2007
IEEE
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
145
click to vote
ASIACRYPT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
152
click to vote
ER
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
142
click to vote
ISAAC
2005
Springer
16 years 3 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...