Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Abstract. We propose a novel method for unsupervised class segmentation on a set of images. It alternates between segmenting object instances and learning a class model. The method...