نتایج جستجو برای: linear arrangement

تعداد نتایج: 515835  

2004
CARSTEN SCHULTZ

The integral cohomology ring of the complement of an arrangement of linear subspaces of a finite dimensional complex projective space is determined by combinatorial data, i.e. the intersection poset and the dimension function.

1998
Jordi Petit

In this paper we survey the work done for graphs on random geometric models. We present some heuristics for the problem of the Minimal Linear Arrangement on 0; 1] 2 and we conclude with a collection of open problems.

2003
Michelle Mills Paul D. Hovland

Irregular applications exhibit poor performance on current computer architectures because of their inefficient use of the memory hierarchy. Figure 1 shows iteration over an edge list as an example of the types of memory references that occur in irregular applications. Run-time data and iteration reordering transformations have been shown to improve the locality of such loops and therefore the p...

Journal: :Archives of dermatology 2003
Akmal S Hassan Klaus W Schulte Thomas Ruzicka Mosaad Megahed

BACKGROUND Deep penetrating nevus is a recently described variant of melanocytic nevi with clinical and histopathological features that may be confused with malignant melanoma, blue nevus, pigmented Spitz nevus, or congenital melanocytic nevus. We report a case with linear arrangement of multiple deep penetrating nevi. To our knowledge, such presentation has never been reported in the literatur...

Journal: :European Journal of Inorganic Chemistry 2021

Zero-, mono- and diperiodic uranyl ion complexes are formed by benzene-1,2,3-tricarboxylate, depending on the structure-directing species used, linear chains based dimeric motifs being a preferred arrangement.

Journal: :British Dental Journal 2004

Journal: :The Iowa Review 1999

Journal: :Inf. Process. Lett. 2003
Robert Hochberg Matthias F. Stallmann

In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for trees—algorithms of time complexity O(n2.2) and O(n1.6) were given by Shiloach [SIAM J. Comput. ...

1996
MICHAEL FALK HIROAKI TERAO

We study cohomology with coefficients in a rank one local system on the complement of an arrangement of hyperplanes A. The cohomology plays an important role for the theory of generalized hypergeometric functions. We combine several known results to construct explicit bases of logarithmic forms for the only non-vanishing cohomology group, under some nonresonance conditions on the local system, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید