Results 261 to 270 of about 403,307 (296)
Some of the next articles are maybe not open access.
Partitioned encryption and achieving simultaneity by partitioning
Information Processing Letters, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zvi Galil, Moti Yung
openaire +2 more sources
Journal of Philosophical Logic, 1999
An approach to the partition semantics of conditional logic was given by \textit{B. Skyrms} [see: Pragmatics and empiricism (Yale Univ. Press, New Haven) (1984)]. In this paper the author investigates the role and the place of Skyrms' semantics in the development of this subject.
openaire +2 more sources
An approach to the partition semantics of conditional logic was given by \textit{B. Skyrms} [see: Pragmatics and empiricism (Yale Univ. Press, New Haven) (1984)]. In this paper the author investigates the role and the place of Skyrms' semantics in the development of this subject.
openaire +2 more sources
Algorithms for graph partitioning on the planted partition model
Random Structures and Algorithms, 1999Summary: The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph \(\ell\)-partition problem is to partition the nodes of an undirected graph into \(\ell\) equal-size groups so as to minimize the total number of
Anne Condon, Richard M. Karp
openaire +3 more sources
Combinatorica, 1993
For even \(n\), let \(p(n)\) denote the number of partitions of \(n\) and \(G(n)\) denote the number of graphical partitions of \(n\). A partition \(\pi=(\lambda_1,\lambda_2,\dots,\lambda_m)\) is graphical if there exists a graph with degree sequence \(\pi\). The authors discuss progress and possible lines in enquiry on the questions of whether or not \
Paul Erdös, L. Bruce Richmond
openaire +2 more sources
For even \(n\), let \(p(n)\) denote the number of partitions of \(n\) and \(G(n)\) denote the number of graphical partitions of \(n\). A partition \(\pi=(\lambda_1,\lambda_2,\dots,\lambda_m)\) is graphical if there exists a graph with degree sequence \(\pi\). The authors discuss progress and possible lines in enquiry on the questions of whether or not \
Paul Erdös, L. Bruce Richmond
openaire +2 more sources
Functional Partitioning of Transcriptional Regulators by Patterned Charge Blocks
Cell, 2023Benjamin R Sabari +2 more
exaly
More Recent Advances in (Hyper)Graph Partitioning
ACM Computing Surveys, 2023Marcelo Fonseca Faraj +2 more
exaly
2010
The chapter is structured as follows: I. Interpretative categories I.1 Dividing without partitioning I.2 Applied forms of partitions I.3 The fragility of terminology II. The attractiveness of partition II.1 The interaction of statehood and nationhood II.2 Equality and inequality in partitioning processes II.3 Multiplying states or the attractiveness of
openaire +3 more sources
The chapter is structured as follows: I. Interpretative categories I.1 Dividing without partitioning I.2 Applied forms of partitions I.3 The fragility of terminology II. The attractiveness of partition II.1 The interaction of statehood and nationhood II.2 Equality and inequality in partitioning processes II.3 Multiplying states or the attractiveness of
openaire +3 more sources
Metric spaces of partitions, and Caccioppoli partitions
2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LEONARDI, Gian Paolo, TAMANINI I.
openaire +3 more sources
Significance of Co-Ion Partitioning in Salt Transport Through Polyamide Reverse Osmosis Membranes
Environmental Science & Technology, 2023Maarten Biesheuvel +2 more
exaly
A Survey of Data Partitioning and Sampling Methods to Support Big Data Analysis
Big Data Mining and Analytics, 2020Tamer Z Emara +2 more
exaly