661 search results - page 126 / 133 » Local Approximation Algorithms for Scheduling Problems in Se... |
PET
2004
Springer
14 years 24 days ago
2004
Springer
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
TIP
2010
13 years 2 months ago
2010
Camera networks are being deployed for various applications like security and surveillance, disaster response and environmental modeling. However, there is little automated process...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...