376 search results - page 68 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
MST
2000
13 years 7 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
MOBICOM
2009
ACM
14 years 2 months ago
2009
ACM
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...