821 search results - page 92 / 165 » Addressing the Petersen graph |
TIT
2011
14 years 6 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
124
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Vehicular ad hoc networks (VANETs) represent promising technologies for improving driving safety and efficiency. Due to the highly dynamic driving patterns of vehicles, it has ...
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
ICIP
2009
IEEE
16 years 28 days ago
2009
IEEE
This paper presents an algorithm for tree-based representation of single images and its applications to segmentation and filtering with depth. In a our recent work, we have addres...