7796 search results - page 1349 / 1560 » On Generalized Schur Numbers |
181
click to vote
FOCS
2006
IEEE
16 years 23 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
181
click to vote
FOCS
2006
IEEE
16 years 23 days ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
203
click to vote
GLOBECOM
2006
IEEE
16 years 23 days ago
2006
IEEE
Abstract—We consider the distributed estimation of an unknown vector signal in a resource constrained sensor network with a fusion center. Due to power and bandwidth limitations,...
176
click to vote
GLOBECOM
2006
IEEE
16 years 23 days ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
170
click to vote
ICNP
2006
IEEE
16 years 22 days ago
2006
IEEE
— Internet routers today can be overwhelmed by a large number of BGP updates triggered by events such as session resets, link failures, and policy changes. Such excessive updates...