2084 search results - page 317 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
111
click to vote
CIAC
2010
Springer
15 years 2 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
GLOBECOM
2009
IEEE
2009
IEEE
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints
15 years 1 months ago
An important performance measure in wireless networks is the manner in which the network can distributively manage its limited energy and spectrum resources, while assuring certain...
ICDE
2008
IEEE
15 years 4 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
NDSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...