495 search results - page 37 / 99 » Probability Trees |
ESA
2006
Springer
15 years 1 months 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 ...
101
click to vote
WEA
2010
Springer
15 years 4 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
14 years 7 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
14 years 10 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-...
180
click to vote
NLP
2000
15 years 1 months 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...