942 search results - page 144 / 189 » Constraints in Graph Drawing Algorithms |
110
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
160
click to vote
JMLR
2010
14 years 9 months ago
2010
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...
137
Voted
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
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 ...
120
Voted
JOIN
2007
15 years 2 months ago
2007
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 ...
125
Voted
AAAI
2012
13 years 5 months ago
2012
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...