7930 search results - page 549 / 1586 » Greedy in Approximation Algorithms |
172
click to vote
COCOON
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
182
click to vote
DMIN
2008
15 years 8 months ago
2008
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
194
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
175
click to vote
PDCN
2007
15 years 8 months ago
2007
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
162
click to vote
AAAI
2006
15 years 8 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...