Sciweavers

254 search results - page 13 / 51
» Binary amiable Words
Sort
View
DM
2007
103views more  DM 2007»
15 years 4 months ago
Codes from the line graphs of complete multipartite graphs and PD-sets
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
Jennifer D. Key, P. Seneviratne
DCC
2004
IEEE
16 years 4 months ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper
NPL
2000
99views more  NPL 2000»
15 years 4 months ago
On the Internal Representations of Product Units
This paper explores internal representation power of product units [1] that act as the functional nodes in the hidden layer of a multi-layer feedforward network. Interesting proper...
Jung-Hua Wang, Yi-Wei Yu, Jia-Horng Tsai
FUIN
2010
98views more  FUIN 2010»
15 years 1 months ago
On the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
ALGORITHMICA
2002
109views more  ALGORITHMICA 2002»
15 years 4 months ago
A Near-Linear Area Bound for Drawing Binary Trees
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
Timothy M. Chan