Concept
Book embedding
Publications associées (24)
Improving speaker turn embedding by crossmodal transfer learning from face embedding
Learning speaker turn embeddings has shown considerable improvement in situations where conventional speaker modeling approaches fail. However, this improvement is relatively limited when compared to the gain observed in face embedding learning, which has ...
2017Decomposition of Multiple Packings with Subquadratic Union Complexity
János Pach, Bartosz Maria Walczak
Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...
Cambridge Univ Press2016Averaged Solvent Embedding Potential Parameters for Multiscale Modeling of Molecular Properties
We derive and validate averaged solvent parameters for embedding potentials to be used in polarizable embedding quantum mechanics/molecular mechanics (QM/MM) molecular property calculations of solutes in organic solvents. The parameters are solvent-specifi ...
Amer Chemical Soc2016Clustered planarity testing revisited
Radoslav Fulek, Jan Kyncl, Igor Malinovic
The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...
2015Fabrication-Aware Design with Performative Criteria
Yuliy Gennadievich Schwartzburg
Artists and architects often need to handle multiple constraints during design of physical constructions. We define a performative constraint as any constraint on design that is tied to the performance of the model--either during fabrication, construction, ...
EPFL2015Free Edge Lengths in Plane Graphs
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a pla ...
Springer2015Outerplanar graph drawings with few slopes
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that Delta - 1 edge slopes suffic ...
Elsevier Science Bv2014Fabrication-aware Design with Intersecting Planar Pieces
Mark Pauly, Yuliy Gennadievich Schwartzburg
We propose a computational design approach to generate 3D models composed of interlocking planar pieces. We show how intricate 3D forms can be created by sliding the pieces into each other along straight slits, leading to a simple construction that does no ...
Blackwell Publishing2013Design and Optimization of Orthogonally Intersecting Planar Surfaces
Mark Pauly, Yuliy Gennadievich Schwartzburg
We present a method for the design of 3D constructions from planar pieces that can be cut easily and cheaply with laser cutters and similar Computer Numerical Control (CNC) machines. By cutting tight slits in intersecting pieces, they can be slid into each ...
Springer Berlin Heidelberg2012Universal Sets for Straight-Line Embeddings of Bicolored Graphs
A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the so-called double chai ...
2011