Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
: We present a vision-based robotic system which uses a combination of several active sensing strategies to grip a free-standing small target object with an initially unknown posit...
Benjamin Deutsch, Frank Deinzer, Matthias Zobel, J...
The control of robot swarming in a distributed manner is a difficult problem because global behaviors must emerge as a result of many local actions. This paper uses a bio-inspired ...
Wei-Min Shen, Peter M. Will, Aram Galstyan, Cheng-...
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...