202 search results - page 34 / 41 » Large-Girth Roots of Graphs |
AHSWN
2010
13 years 7 months ago
2010
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
MVA
2008
13 years 7 months ago
2008
Abstract We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components an...
GIS
2007
ACM
13 years 11 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
FOCS
2003
IEEE
14 years 20 days ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
ECOOP
2003
Springer
14 years 18 days ago
2003
Springer
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...