Sciweavers

367 search results - page 32 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
AI
2007
Springer
14 years 2 months ago
Adding Local Constraints to Bayesian Networks
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...
Mark Crowley, Brent Boerlage, David Poole
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 8 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
ALGOSENSORS
2009
Springer
14 years 3 months ago
A Note on Uniform Power Connectivity in the SINR Model
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 ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
COLT
2004
Springer
14 years 1 months ago
Graphical Economics
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
Sham Kakade, Michael J. Kearns, Luis E. Ortiz
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 2 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca