497 search results - page 82 / 100 » Approximating max-min linear programs with local algorithms |
105
click to vote
PDCN
2004
14 years 11 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
IFIP
2007
Springer
15 years 3 months ago
2007
Springer
Wormhole attacks can destabilize or disable wireless sensor networks. In a typical wormhole attack, the attacker receives packets at one point in the network, forwards them through...
ER
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
ACL
2011
14 years 1 months ago
2011
This paper presents an attempt at building a large scale distributed composite language model that simultaneously accounts for local word lexical information, mid-range sentence s...