3040 search results - page 87 / 608 » Independent Natural Extension |
DAM
2007
13 years 9 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
DAM
1999
13 years 8 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
IMA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we discuss the idea of block cipher embeddings and consider a natural algebraic framework for such constructions. In this approach we regard block cipher state spaces...
FDL
2004
IEEE
14 years 27 days ago
2004
IEEE
This paper presents a new approach to design embedded systems based on dynamic partial reconfigurable FPGAs. The approach is intended to allow designing of systems with runtime re...
IWPT
2001
13 years 10 months ago
2001
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which ...