7055 search results - page 3 / 1411 » Some New 4-Designs |
ISMM
2009
Springer
14 years 25 days ago
2009
Springer
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
SIAMMAX
2010
13 years 1 months ago
2010
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The conside...
ENTCS
2002
13 years 6 months ago
2002
We consider the dual of Theorem 1 from [33], relating closure conditions on subcategories with projectivity classes for collections of discrete cocones. We extend these results by...
MOC
1998
13 years 6 months ago
1998
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
FUIN
2008
13 years 5 months ago
2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...