495 search results - page 37 / 99 » Probability Trees |
ESA
2006
Springer
14 years 10 days ago
2006
Springer
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
EMNLP
2009
13 years 6 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
NLP
2000
14 years 7 days ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...