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...
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 ...
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 ...
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 ...
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 ...