Sciweavers

26 search results - page 2 / 6
» Independence for partition regular equations
Sort
View
COCOON
2007
Springer
14 years 1 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
SIAMSC
2008
146views more  SIAMSC 2008»
13 years 6 months ago
Long Time Numerical Solution of the Navier--Stokes Equations Based on a Sequential Regularization Formulation
Abstract. The sequential regularization method is a reformulation of the unsteady Navier-Stokes equations from the view point of constrained dynamical systems or approximate Helmho...
Ping Lin, Jian-Guo Liu, Xiliang Lu
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 6 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
13 years 11 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
ISBI
2008
IEEE
14 years 7 months ago
Robust image registration based on a Partition of Unity Finite Element Method
In this paper, we present a robust, hierarchical Partition of Unity Finite Element Method (PUFEM) to compute the transformation between two images, which is represented by a non-r...
Laurent D. Cohen, Oudom Somphone, Shérif Ma...