Hough voting methods efficiently handle the high complexity of multiscale,
category-level object detection in cluttered scenes. The primary weakness
of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supp...
It is now possible to turn almost any object into an interface. What one must do, however is to explore the user’s needs and perceptions in order to create the metaphors necessa...
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...