نتایج جستجو برای: unmixed graph
تعداد نتایج: 198434 فیلتر نتایج به سال:
Dickenstein, A., N. Fitchas, M. Giusti and C. Sessa, The membership problem for unmixed polynomial ideals is solvable in single exponential time, Discrete Applied Mathematics 33 (1991) 73-94. Deciding membership for polynomial ideals represents a classical problem of computational commutative algebra which is exponential space hard. This means that the usual al membership problem which are base...
A rich body of research concerns causes of Stroop effects plus applications of Stroop. However, several questions remain. We included assessment of errors with children and adults (N = 316), who sat either a task wherein each block employed only trials of one type (unmixed task) or where every block comprised of a mix of the congruent, neutral, and incongruent trials. Children responded slower ...
Let R be a polynomial ring over a field in an unspecified number of variables. We prove that if J ⊂ R is an ideal generated by three cubic forms, and the unmixed part of J contains a quadric, then the projective dimension of R/J is at most 4. To this end, we show that if K ⊂ R is a three-generated ideal of height two and L ⊂ R an ideal linked to the unmixed part of K, then the projective dimens...
We describe an audio-service for collaborative network applications, designed to support many simultaneous audio sources and to operate across the Internet. Our service introduces and exploits a new technique called distributed partial mixing to dynamically adapt to varying numbers of speakers and network congestion. A collection of networked partial audio mixers is arranged as a distributed gr...
This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid Sylvester and Bézout type. The results extend those in [14] by giving a complete combinatorial description of the matrix. Previous work by D’Andrea [5] gave pure ...
An equigenerated monomial ideal $$I$$ in the polynomial ring $$R=k[z_1,\ldots, z_n]$$ is a Freiman if $$\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$$ , where $$\ell(I)$$ analytic spread of and $$\mu(I)$$ number minimal generators . In this paper we classify all simple connected unmixed bipartite graphs whose cover ideals are ideals.
We present a novel non-iterative and rigorously motivated approach for estimating hidden Markov models (HMMs) and factorial hidden Markov models (FHMMs) of high-dimensional signals. Our approach utilizes the asymptotic properties of a spectral, graph-based approach for dimensionality reduction and manifold learning, namely the diffusion framework. We exemplify our approach by applying it to the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید