6274 search results - page 582 / 1255 » From query complexity to computational complexity |
207
click to vote
ECML
2003
Springer
16 years 11 days ago
2003
Springer
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
176
click to vote
LACL
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
190
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
194
click to vote
ICANN
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
198
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...