Sciweavers

4856 search results - page 970 / 972
» What Values in Design
Sort
View
IACR
2011
104views more  IACR 2011»
12 years 7 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
12 years 6 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
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...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 3 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
SIGCOMM
2012
ACM
11 years 9 months ago
HyperDex: a distributed, searchable key-value store
Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance...
Robert Escriva, Bernard Wong, Emin Gün Sirer
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 9 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor