413 search results - page 48 / 83 » On Solving Geometric Optimization Problems Using Shortest Pa... |
MP
2008
13 years 7 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
EOR
2007
13 years 7 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
We address the problem of estimating the three-dimensional shape and radiance of a surface in space from images obtained with different focal settings. We pose the problem as an in...
ALGORITHMICA
2005
13 years 7 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...