4865 search results - page 530 / 973 » The Complexity of Graph Connectivity |
254
click to vote
DIALM
2003
ACM
16 years 9 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
187
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
Spectral decomposition of mesh geometry has first been introduced by Taubin for geometry processing purposes. It has been extended to address transmission issues by Karni & Go...
180
Voted
MOBISYS
2003
ACM
16 years 6 months ago
2003
ACM
We describe two small and portable TCP/IP implementations fulfilling the subset of RFC1122 requirements needed for full host-to-host interoperability. Our TCP/IP implementations d...
196
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We put forth a unified framework for downlink and uplink scheduling of multiple connections with diverse qualityof-service requirements, where each connection transmits using ...
175
click to vote
ICAC
2005
IEEE
16 years 20 days ago
2005
IEEE
Computing systems have become so complex that the IT industry recognizes the necessity of deliberative methods to make these systems self-configuring, self-healing, selfoptimizin...