Results 11 to 20 of about 2,455,447 (352)
MultiDiffusion: Fusing Diffusion Paths for Controlled Image Generation [PDF]
International Conference on Machine Learning, 2023 Recent advances in text-to-image generation with diffusion models present transformative capabilities in image quality. However, user controllability of the generated image, and fast adaptation to new tasks still remains an open challenge, currently ...
Omer Bar-Tal +3 more
semanticscholar +1 more source
Along dark paths (Per opaca viarum) [PDF]
, 2021 For wind orchestra and six solo celli. Along Dark Paths (Per Opaca Viarum) was commissioned by the Koninklijk Harmonieorkest Vooruit Harelbeke, and is dedicated to them and Mr. Erik Desimpelaere in friendship.
Hesketh, K.
core +6 more sources
Littelmann paths and Brownian paths [PDF]
Duke Mathematical Journal, 2005 We study some path transformations related to Littelmann path model and their applications to representation theory and Brownian motion in a Weyl chamber.
Biane, Philippe +2 more
openaire +5 more sources
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
The Path to Path-Traced Movies [PDF]
Foundations and Trends® in Computer Graphics and Vision, 2016 Path tracing is one of several techniques to render photorealistic images by simulating the physics of light propagation within a scene. The roots of path tracing are outside of computer graphics, in the Monte Carlo simulations developed for neutron transport.
Per H. Christensen, Wojciech Jarosz
openaire +2 more sources
Physical Review Letters, 2020 Main Text: 5 pages, 5 figures, 7 equations.
Mandelli, Davide +2 more
openaire +4 more sources
Minimum path bases and relevant paths [PDF]
Networks, 2005 AbstractGiven an undirected graph G(V,E) and a vertex subset U ⊆ V the U‐space is the vector space over GF(2) spanned by the paths with end‐points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U‐space. Although the size distribution of subgraphs is the same in all minimum
Petra M. Gleiss +2 more
openaire +4 more sources
Exact Values for Some Size Ramsey Numbers of Paths and Cycles
Frontiers in Physics, 2020 For the graphs G1, G2, and G, if every 2-coloring (red and blue) of the edges of G results in either a copy of blueG1 or a copy of redG2, we write G → (G1, G2).
Xiangmei Li +3 more
doaj +1 more source
SoPhie: An Attentive GAN for Predicting Paths Compliant to Social and Physical Constraints [PDF]
Computer Vision and Pattern Recognition, 2018 This paper addresses the problem of path prediction for multiple interacting agents in a scene, which is a crucial step for many autonomous platforms such as self-driving cars and social robots.
Amir Sadeghian +5 more
semanticscholar +1 more source
Paths of specified length in random k-partite graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Fix positive integers k and l. Consider a random k-partite graph on n vertices obtained by partitioning the vertex set into V_i, (i=1, \ldots,k) each having size Ω (n) and choosing each possible edge with probability p.
C.R. Subramanian
doaj +1 more source