Sciweavers

3305 search results - page 136 / 661
» Can we Rely on SQL
Sort
View
ASIACRYPT
2010
Springer
13 years 8 months ago
Short Non-interactive Zero-Knowledge Proofs
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
Jens Groth
IJNSEC
2010
66views more  IJNSEC 2010»
13 years 5 months ago
Finding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
Liam Wagner, Stuart McDonald
ICCV
2009
IEEE
2030views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Robust Tracking-by-Detection using a Detector Confidence Particle Filter
We propose a novel approach for multi-person trackingby- detection in a particle filtering framework. In addition to final high-confidence detections, our algorithm uses the con...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
ECCV
2002
Springer
15 years 5 days ago
Color-Based Probabilistic Tracking
Color-based trackers recently proposed in [3,4,5] have been proved robust and versatile for a modest computational cost. They are especially appealing for tracking tasks where the ...
Carine Hue, Jaco Vermaak, Michel Gangnet, Patrick ...
PODS
2009
ACM
229views Database» more  PODS 2009»
14 years 10 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi