666 search results - page 85 / 134 » The Pipelined Set Cover Problem |
ICDCSW
2007
IEEE
14 years 4 months ago
2007
IEEE
— With the rapid growth of wireless sensor systems deployment, data quality has become a critical issue to the success of these applications. In this paper, we first raise the d...
CPC
2006
13 years 10 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
COR
2007
13 years 10 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
JGAA
2006
13 years 10 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...