115 search results - page 15 / 23 » The Complexity of List Ranking of Trees |
191
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
138
click to vote
CICLING
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. This paper describes the application of the perceptron algorithm to the morphological disambiguation of Turkish text. Turkish has a productive derivational morphology. Du...
176
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
142
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
Effective learning in multi-label classification (MLC) requires an ate level of abstraction for representing the relationship between each instance and multiple categories. Curren...
171
click to vote
LACL
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...