1554 search results - page 177 / 311 » Parameterized Complexity and Approximation Algorithms |
142
click to vote
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
121
click to vote
CLUSTER
2001
IEEE
15 years 7 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
119
click to vote
TVCG
2008
15 years 3 months ago
2008
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
118
click to vote
DIALM
2004
ACM
15 years 8 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
106
click to vote
RECSYS
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...