3208 search results - page 417 / 642 » A Lower Bound for Primality |
149
click to vote
JCT
2011
15 years 1 months ago
2011
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
195
click to vote
MST
2011
15 years 1 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
184
click to vote
SIAMCO
2010
15 years 1 months ago
2010
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
148
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
161
click to vote
TSP
2010
15 years 1 months ago
2010
We propose structural multidimensional multi-channel filter banks with desirable numbers of vanishing moments for the analysis and synthesis banks. For a two-channel filter bank, w...