1477 search results - page 86 / 296 » On Graph Problems in a Semi-streaming Model |
143
click to vote
IMCSIT
2010
14 years 11 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
128
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
117
click to vote
SIAMDM
2008
15 years 1 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
AI
2007
Springer
15 years 7 months ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘orâ...
111
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...