Sciweavers

11949 search results - page 2066 / 2390
» Some results on (a:b)-choosability
Sort
View
VLDB
2012
ACM
360views Database» more  VLDB 2012»
14 years 2 months ago
An adaptive updating protocol for reducing moving object database workload
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
Su Chen, Beng Chin Ooi, Zhenjie Zhang
PODS
2012
ACM
281views Database» more  PODS 2012»
13 years 9 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
SIGIR
2012
ACM
13 years 9 months ago
Time-based calibration of effectiveness measures
Many current effectiveness measures incorporate simplifying assumptions about user behavior. These assumptions prevent the measures from reflecting aspects of the search process...
Mark D. Smucker, Charles L. A. Clarke
PODC
2012
ACM
13 years 9 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
« Prev « First page 2066 / 2390 Last » Next »