2924 search results - page 391 / 585 » Lower Bounds in Distributed Computing |
144
click to vote
IPCO
2010
15 years 6 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
137
click to vote
ISPD
2010
ACM
15 years 11 months ago
2010
ACM
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...
144
click to vote
INFOCOM
2010
IEEE
15 years 3 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 ...
124
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
A non-parametric (NP) sampling method is introduced for obtaining the joint distribution of a pair of images. This method is called NP windowing and is equivalent to sampling the ...
199
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...