3204 search results - page 599 / 641 » The b-chromatic Number of a Graph |
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
In this paper, we describe the challenges of prototyping a reference application on System S, a distributed stream processing middleware under development at IBM Research. With a ...
FOCS
2006
IEEE
14 years 1 months 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...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
GLOBECOM
2006
IEEE
14 years 1 months 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...
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...