617 search results - page 115 / 124 » On the Chromatic Number of Random Graphs |
TMC
2011
13 years 2 months ago
2011
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
TIP
2010
13 years 2 months ago
2010
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
STOC
2010
ACM
14 years 17 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...