14548 search results - page 2724 / 2910 » The Optimal Path-Matching Problem |
170
click to vote
NIPS
2008
15 years 7 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
189
Voted
NIPS
2008
15 years 7 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
176
click to vote
NIPS
2008
15 years 7 months ago
2008
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
202
click to vote
NIPS
2008
15 years 7 months ago
2008
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
168
click to vote
ISCAPDCS
2007
15 years 7 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...