Sciweavers

357 search results - page 11 / 72
» Solving Generalized Maximum Dispersion with Linear Programmi...
Sort
View
CGF
2008
126views more  CGF 2008»
13 years 7 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
INFOCOM
2006
IEEE
14 years 1 months ago
Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks
— Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wire...
Jian Tang, Guoliang Xue, Weiyi Zhang
IFIP
2005
Springer
14 years 1 months ago
On Warm Starts for Interior Methods
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...
Anders Forsgren
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
CSR
2009
Springer
13 years 8 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper