3055 search results - page 171 / 611 » Randomized Search Trees |
99
Voted
COLING
2008
15 years 2 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
115
Voted
ICANN
2010
Springer
15 years 26 days ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
109
click to vote
RSA
2011
14 years 3 months ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
143
Voted
ERCIMDL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
DCC
2005
IEEE
16 years 8 days ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...