Results 251 to 260 of about 768,033 (273)
Topology-aware adaptive scheduling algorithm for heterogeneous AI-PC collaborative computing environments. [PDF]
Sci RepShao S, Ding X, Zhao B, Ye P.
europepmc +1 more source
State Migration in Styx: Towards Serverless Transactional Functions. [PDF]
VLDB JPsarakis K +4 more
europepmc +1 more source
A multimodal EEG-based psychological risk representation method using spatiotemporal graph attention and adaptive gated fusion. [PDF]
Front PsychiatryWu Y, Zhang G, Yu G.
europepmc +1 more source
SELF-Tree: An Interpretable Model for Multivariate Causal Direction Heterogeneity Analysis. [PDF]
PsychometrikaLi Z, Wen H.
europepmc +1 more source
MPM-based simulation and bounded-error compression of material points for magnetic tactile sensors. [PDF]
Front Robot AILin X, Lin G, Liu R, Wang A, Lou Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Partitional Labelings of Graphs
Mathematics in Computer Science, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rikio Ichishima, Akito Oshima
openaire +4 more sources
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Konstantin Andreev, Harald Räcke
openaire +1 more source
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Konstantin Andreev, Harald Räcke
openaire +1 more source
SIAM Journal on Computing, 1992
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Thang Nguyen Bui, Andrew Peck
openaire +3 more sources
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Thang Nguyen Bui, Andrew Peck
openaire +3 more sources
Theory of Computing Systems, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angsheng Li, Peng Zhang 0008
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angsheng Li, Peng Zhang 0008
openaire +3 more sources