Sciweavers

2370 search results - page 141 / 474
» A Structured Set of Higher-Order Problems
Sort
View
149
Voted
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 3 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
133
Voted
ICML
2010
IEEE
15 years 4 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
106
Voted
CDC
2008
IEEE
15 years 10 months ago
A Partial order approach to decentralized control
— In this paper we employ the theory of partially ordered sets to model and analyze a class of decentralized control problems. We show that posets provide a natural way of modeli...
Parikshit Shah, Pablo A. Parrilo
143
Voted
JMLR
2010
187views more  JMLR 2010»
14 years 10 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
136
Voted
CSCLP
2007
Springer
15 years 9 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek