Sciweavers

942 search results - page 144 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano
JMLR
2010
149views more  JMLR 2010»
13 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
13 years 23 days ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...
JOIN
2007
91views more  JOIN 2007»
13 years 9 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
AAAI
2012
12 years 9 days ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...