Sciweavers

4911 search results - page 88 / 983
» Tree dependence analysis
Sort
View
DM
2008
104views more  DM 2008»
14 years 10 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
TSD
2004
Springer
15 years 3 months ago
Building a Dependency-Based Grammar for Parsing Informal Mathematical Discourse
Discourse in formal domains, such as mathematics, is characterized by a mixture of telegraphic natural language and embedded formal expressions. Little is known about the suitabil...
Magdalena Wolska, Ivana Kruijff-Korbayová
EUROCRYPT
2010
Springer
15 years 2 months ago
Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
This paper presents a formal security analysis of SSH in counter mode in a security model that accurately captures the capabilities of real-world attackers, as well as security-rel...
Kenneth G. Paterson, Gaven J. Watson
JMLR
2002
102views more  JMLR 2002»
14 years 9 months ago
Efficient Algorithms for Decision Tree Cross-validation
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
Hendrik Blockeel, Jan Struyf
COLING
2008
14 years 11 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