Sciweavers

3055 search results - page 36 / 611
» Randomized Search Trees
Sort
View
COLING
2008
13 years 10 months ago
Word Sense Disambiguation for All Words using Tree-Structured Conditional Random Fields
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...
Jun Hatori, Yusuke Miyao, Jun-ichi Tsujii
ECML
2006
Springer
14 years 20 days ago
TildeCRF: Conditional Random Fields for Logical Sequences
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...
Bernd Gutmann, Kristian Kersting
SIS
2004
13 years 10 months ago
Efficient Tree Search in Encrypted Data
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 ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
ALGORITHMICA
2006
90views more  ALGORITHMICA 2006»
13 years 9 months ago
Destruction of Very Simple Trees
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...
James Allen Fill, Nevin Kapur, Alois Panholzer
ISCIS
2009
Springer
14 years 1 months ago
Calculating the VC-dimension of decision trees
—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...
Ozlem Asian, Olcay Taner Yildiz, Ethem Alpaydin