115 search results - page 7 / 23 » The Complexity of List Ranking of Trees |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
ML
2000
ACM
14 years 9 months ago
2000
ACM
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
VMCAI
2007
Springer
15 years 4 months ago
2007
Springer
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
102
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
150
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...