Results 211 to 220 of about 424,178 (243)
Some of the next articles are maybe not open access.
On vector space partitions and uniformly resolvable designs
Designs, Codes and Cryptography, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrew Blinco +5 more
openaire +3 more sources
On some resolving partitions for the lexicographic product of two graphs
International Journal of Computer Mathematics, 2016Given a connected graph , the distance between two vertices is the length of a shortest u−v path in G. The distance between a vertex and a subset is defined as . An ordered partition of vertices of G is a resolving partition of G, if for any two different vertices u,v of G there exists such that .
Nicolás Campanelli +1 more
openaire +1 more source
Binary-space-partitioned images for resolving image-based visibility
IEEE Transactions on Visualization and Computer Graphics, 2004We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting.
Chi-Wing Fu +4 more
openaire +4 more sources
On Partially Resolvable t–Partitions
1982Publisher Summary This chapter discusses partially resolvable t -partitions. The chapter discusses primarily with the case |P|= 1, |S| = 1. The corresponding partially resolvable t -partitions are denoted by PRP t -( p, s, υ ; m ) provided P = { p }, S = { s }.
Charlotte Huang +2 more
openaire +1 more source
Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors
1993 International Conference on Parallel Processing - ICPP'93 Vol2, 1993We develop compile-time iteration partitioning techniques for private-cache shared-memory mulriprocessors. Our techniques assign loop iterations to a set of processors so that cache coherency traffic due io interprocessor communication is minimized and load balance is maintained.
Karen A. Tomko, Santosh G. Abraham
openaire +2 more sources
On resolving acyclic partitions of graphs.
Ars Comb., 2004A resolving \(k\)-partition of a graph \(G\) is an ordered partition of its vertex-set into \(k\) parts such that all vertices have a different vector of closest distances to these parts. The lowest \(k\) for which such a partition exists, without cycle inside any part, is the resolving acyclic number \(a_r(G)\). Among others, it is shown that for any \
Varaporn Saenpholphat, Ping Zhang 0004
openaire +2 more sources
Resolving resource partitioning in parrotfishes (Scarini) using microhistology of feeding substrata
Coral Reefs, 2020Parrotfishes (Scarini) are considered key agents in coral reef health and recovery, but the drivers of parrotfish–coral dynamics remain contentious. The prevailing view of parrotfishes as ecosystem engineers is based on the perceived removal of algal turf, macroalgae and sediment, but these are effects of feeding, not causes.
Georgina M. Nicholson +1 more
openaire +1 more source
Space- and Time-Resolved Dynamics of Fast Electrons and of the Energy Partition Into Cold Electrons
IEEE Transactions on Plasma Science, 2008Through the time- and space-resolved interferometry of a short-pulse low-energy probe beam reflecting on the rear surface of a solid target irradiated on its front surface by a high-intensity laser, we have measured a very abrupt expansion of the target rear surface.
ANTICI, PATRIZIO +12 more
openaire +2 more sources
Sharp bounds of partition resolvability of convex polytopes
Journal of Combinatorial Mathematics and Combinatorial Computing<p>Graph theory serves as a central and dynamic framework for the design and analysis of networks. Convex polytopes, as fundamental geometric entities, encompass a rich variety of mathematical structures and problems. The basic theory of convex polytopes involves the study of faces, normal cones, duality—particularly polarity—along with ...
openaire +1 more source
Physica Scripta, 1985
Summary: In the resolvent methods for solving the Schrödinger equation, the eigenvalues are represented by simple poles of the so-called Weinstein function, whereas the eigenfunctions are represented by expressions of the form \(\infty/\infty\). We show that there exists a simple identity which permits the evaluation of the eigenfunction, and which ...
openaire +1 more source
Summary: In the resolvent methods for solving the Schrödinger equation, the eigenvalues are represented by simple poles of the so-called Weinstein function, whereas the eigenfunctions are represented by expressions of the form \(\infty/\infty\). We show that there exists a simple identity which permits the evaluation of the eigenfunction, and which ...
openaire +1 more source

