Sciweavers

128 search results - page 8 / 26
» Updating Probabilities with Data and Moments
Sort
View
CONPAR
1992
14 years 3 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
ICASSP
2011
IEEE
13 years 2 months ago
Generalized Restricted Isometry Property for alpha-stable random projections
The Restricted Isometry Property (RIP) is an important concept in compressed sensing. It is well known that many random matrices satisfy the RIP with high probability, whenever th...
Daniel Otero, Gonzalo R. Arce
VLDB
2003
ACM
156views Database» more  VLDB 2003»
14 years 11 months ago
Watermarking relational data: framework, algorithms and analysis
We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and de...
Rakesh Agrawal, Peter J. Haas, Jerry Kiernan
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 5 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra
ICASSP
2011
IEEE
13 years 2 months ago
Multi-sensor PHD: Construction and implementation by space partitioning
The Probability Hypothesis Density (PHD) is a well-known method for single-sensor multi-target tracking problems in a Bayesian framework, but the extension to the multi-sensor cas...
Emmanuel Delande, Emmanuel Duflos, Philippe Vanhee...