2492 search results - page 117 / 499 » On the General Signature Trees |
152
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicit...
176
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
170
click to vote
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
180
click to vote
KI
2004
Springer
15 years 11 months ago
2004
Springer
This paper proposes a new corpus-based approach for deriving syntactic structures and generating parse trees of natural language sentences. The parts of speech (word categories) of...
162
click to vote
ICML
1996
IEEE
15 years 10 months ago
1996
IEEE
A learner's performance does not rely only on the representation language and on the algorithm inducing a hypothesis in this language. Also the way the induced hypothesis is ...