Sciweavers

523 search results - page 94 / 105
» Improved Approximation Algorithms for Maximum Graph Partitio...
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
SPAA
2004
ACM
14 years 29 days ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
COMPGEOM
2010
ACM
14 years 11 days ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
WIOPT
2010
IEEE
13 years 5 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
14 years 15 days ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao