1845 search results - page 181 / 369 » Machine-Learning Applications of Algorithmic Randomness |
113
click to vote
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
110
Voted
TOCS
2008
15 years 1 months ago
2008
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
119
Voted
NIPS
2008
15 years 3 months ago
2008
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
115
click to vote
CLEF
2010
Springer
15 years 1 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
124
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...