Sciweavers

27274 search results - page 5208 / 5455
» A framework for framework documentation
Sort
View
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 10 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
COLT
2006
Springer
15 years 10 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
FOCS
2004
IEEE
15 years 10 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
FOCS
2004
IEEE
15 years 10 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
« Prev « First page 5208 / 5455 Last » Next »