6142 search results - page 1121 / 1229 » The Complexity of Partition Functions |
164
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
171
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
144
click to vote
FEDCSIS
2011
14 years 4 months ago
2011
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
200
click to vote
ICDE
2012
IEEE
14 years 3 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
256
click to vote
PODS
2009
ACM
16 years 4 months ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...