528 search results - page 73 / 106 » Approximation algorithm for minimal convergecast time proble... |
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
IPCCC
2007
IEEE
14 years 2 months ago
2007
IEEE
Existing packets scheduling algorithms designed for energy-efficient wireless networks ignore important features of periodic packets, thereby being inadequate for periodic packets...