Sciweavers

101 search results - page 13 / 21
» Experimental study of protocol-independent redundancy elimin...
Sort
View
JAL
2006
114views more  JAL 2006»
14 years 9 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
15 years 11 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
15 years 10 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
INFOCOM
2007
IEEE
15 years 4 months ago
Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
Mea Wang, Baochun Li
SAC
2008
ACM
14 years 9 months ago
Continuous k-dominant skyline computation on multidimensional data streams
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates another ...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...