4066 search results - page 42 / 814 » Improved Algorithms and Analysis for Secretary Problems and ... |
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
FLAIRS
2000
13 years 10 months ago
2000
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise num...