Buscar
Mostrando ítems 1-10 de 1025
The Graph Sandwich Problem for P-4-sparse graphs
(Elsevier Science BvAmsterdamHolanda, 2009)
Sparse Array Design Using the Genetic Algorithm for Optimizing the Radiation Pattern of Linear Arrays
(2019-01-01)
The genetic algorithm was used to obtain sparse arrays with 8, 16, 32 and 64 transducers in a possible aperture size of 128 elements. The optimization was made by minimizing a fitness function that takes into account the ...
Fast-forward/fast-backward substitutions on vector computers
(Institute of Electrical and Electronics Engineers (IEEE), 1999-11-01)
This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different ...
Fast-forward/fast-backward substitutions on vector computers
(Institute of Electrical and Electronics Engineers (IEEE), 1999-11-01)
This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different ...
Sparse bounds for the discrete spherical maximal functions
(2020)
We prove sparse bounds for the spherical maximal operator of Magyar, Stein and Wainger. The bounds are conjecturally sharp, and contain an endpoint estimate. The new method of proof is inspired by ones by Bourgain and ...
On the Minimum Sum Coloring of P4-sparse graphs
(Springer Tokyo, 2014-03)
In this paper, we study the Minimum Sum Coloring (MSC) problem on P4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum ...
Sparse 1D discrete Dirac operators I: Quantum transport
(Academic Press Inc. Elsevier B.V., 2012-01-15)
Some dynamical lower bounds for one-dimensional discrete Dirac operators with different classes of sparse potentials are presented, and the particular role of the particle mass is emphasized. (C) 2011 Elsevier B.V. All ...
Sparse 1D discrete Dirac operators I: Quantum transport
(Academic Press Inc. Elsevier B.V., 2012-01-15)
Some dynamical lower bounds for one-dimensional discrete Dirac operators with different classes of sparse potentials are presented, and the particular role of the particle mass is emphasized. (C) 2011 Elsevier B.V. All ...
Sparse 1D discrete Dirac operators I: Quantum transport
(Academic Press Inc. Elsevier B.V., 2014)
A one-to-one correspondence between potential solutions ofthe cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs
(Elsevier, 2015)
In this note we show a one-to-one correspondence between potentially optimal solutions to the cluster deletion problem in a graph Gand potentially optimal solutions for the minimum sum coloring problem in G(i.e. the ...