1060 search results - page 75 / 212 » On the Discovery of Random Trees |
ICMLA
2008
14 years 11 months ago
2008
Mining for outliers in sequential databases is crucial to forward appropriate analysis of data. Therefore, many approaches for the discovery of such anomalies have been proposed. ...
ACL
2008
14 years 11 months ago
2008
The paper presents a novel sentence trimmer in Japanese, which combines a non-statistical yet generic tree generation model and Conditional Random Fields (CRFs), to address improv...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...