391 search results - page 16 / 79 » Comparison-Based Algorithms Are Robust and Randomized Algori... |
SIGMOD
1998
ACM
13 years 12 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
CISS
2007
IEEE
13 years 7 months ago
2007
IEEE
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
AI
2003
Springer
14 years 27 days ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
TAL
2010
Springer
13 years 6 months ago
2010
Springer
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...