3055 search results - page 36 / 611 » Randomized Search Trees |
111
click to vote
COLING
2008
15 years 3 months ago
2008
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
119
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
115
click to vote
SIS
2004
15 years 3 months ago
2004
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
109
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
119
click to vote
ISCIS
2009
Springer
15 years 7 months ago
2009
Springer
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...