2137 search results - page 260 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
324
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
185
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
172
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
192
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
268
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...