3008 search results - page 414 / 602 » Independence in connected graphs |
155
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
163
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
189
click to vote
PAKDD
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
190
click to vote
ASPDAC
2004
ACM
16 years 11 days ago
2004
ACM
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
190
click to vote
ICPR
2002
IEEE
15 years 12 months ago
2002
IEEE
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...