4066 search results - page 205 / 814 » Almost Complete Sets |
148
click to vote
JAL
1998
15 years 6 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
196
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
183
click to vote
JCT
2010
15 years 5 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
192
click to vote
SMC
2010
IEEE
15 years 4 months ago
2010
IEEE
In this study, the task of obtaining accurate and comprehensible concept descriptions of a specific set of production instances has been investigated. The suggested method, inspire...
210
click to vote
FPGA
2009
ACM
15 years 4 months ago
2009
ACM
Multi-field packet classification is a key enabling function of a variety of network applications, such as firewall processing, Quality of Service differentiation, traffic billing...