Sciweavers

3381 search results - page 563 / 677
» Extending Dependencies with Conditions
Sort
View
PODC
2012
ACM
13 years 9 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
ICDT
2009
ACM
130views Database» more  ICDT 2009»
16 years 7 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
PODS
2008
ACM
165views Database» more  PODS 2008»
16 years 7 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
CISS
2008
IEEE
16 years 1 months ago
Peer-to-Peer utility maximization
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
Minghua Chen, Sudipta Sengupta, Miroslav Ponec, Ph...
CISS
2007
IEEE
16 years 1 months ago
Cooperation Strategies for Two Co-located receivers, with no CSI at the transmitter
— We study the case of a single transmitter, which communicates to two co-located users, through an independent block Rayleigh fading channel. The co-location nature of the users...
Amichai Sanderovich, Avi Steiner, Shlomo Shamai