2924 search results - page 583 / 585 » Lower Bounds in Distributed Computing |
NIPS
2008
13 years 9 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
SIROCCO
2008
13 years 9 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
JSAC
2008
13 years 7 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
JSAC
2007
13 years 7 months ago
2007
— This paper presents an analytical approach to determining the maximum number of on/off voice flows that can be supported over a wireless local area network (WLAN), under a qua...