Sciweavers

2492 search results - page 19 / 499
» On the General Signature Trees
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 7 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
13 years 8 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs
JCT
2011
57views more  JCT 2011»
13 years 2 months ago
Generalized Stirling permutations, families of increasing trees and urn models
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the c...
Svante Janson, Markus Kuba, Alois Panholzer
SBRN
2008
IEEE
14 years 1 months ago
Combining Distances through an Auto-Encoder Network to Verify Signatures
In this paper we present a system for off-line signature verification. The paper’s contributions are: i) Five distances were calculated and evaluated over the signature databas...
Milena R. P. Souza, Leandro R. Almeida, George D. ...
BICOB
2009
Springer
14 years 2 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...