420 search results - page 55 / 84 » Some Algorithmic Problems in Polytope Theory |
NIPS
2007
14 years 11 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
IOR
2007
14 years 9 months ago
2007
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
115
click to vote
CVPR
2012
IEEE
13 years 4 days ago
2012
IEEE
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...