783 search results - page 113 / 157 » Improved approximation algorithms for the freeze-tag problem |
179
click to vote
FOCS
2006
IEEE
16 years 3 days ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
196
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
155
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
157
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
161
click to vote
ICASSP
2009
IEEE
16 years 24 days ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...