1060 search results - page 109 / 212 » On the Discovery of Random Trees |
162
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
263
click to vote
TCIAIG
2010
15 years 1 months ago
2010
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
151
click to vote
INFOCOM
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract—Existing approaches to P2P streaming can be divided into two general classes: (i) tree-based approaches use pushbased content delivery over multiple tree-shaped overlays...
173
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
199
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...