334 search results - page 20 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
SWAT
2000
Springer
14 years 7 hour ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
ICAART
2010
INSTICC
14 years 5 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
IJFCS
2006
13 years 8 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
TKDE
2008
13 years 8 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...