1389 search results - page 234 / 278 » Improved Approximation Algorithms for Label Cover Problems |
MP
2008
14 years 10 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 ...
114
click to vote
JMLR
2012
13 years 11 days ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
102
click to vote
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...
106
click to vote
TON
2008
14 years 9 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
101
click to vote
SIGMOD
2011
ACM
14 years 22 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...