7006 search results - page 608 / 1402 » Approximation Algorithms |
164
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
205
click to vote
ANOR
2010
15 years 5 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
174
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
195
click to vote
CAD
2007
Springer
15 years 7 months ago
2007
Springer
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
155
click to vote
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...