1857 search results - page 192 / 372 » Minimum Degree Orderings |
159
click to vote
JCO
2007
15 years 6 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
130
click to vote
ADCM
2004
15 years 6 months ago
2004
Abstract. We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in ...
148
click to vote
MOC
2000
15 years 6 months ago
2000
This article considers the problem of evaluating all pure and mixed partial derivatives of some vector function defined by an evaluation procedure. The natural approach to evaluati...
157
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
We have developed a new method for Japanese-to-English translation of tense, aspect, and modality that uses an example-based method. In this method the similarity between input an...
150
click to vote
JAT
2010
15 years 5 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...