Results 21 to 30 of about 2,595,187 (128)
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA).
Nüßlein, Jonas +4 more
core
Differential item functioning detection across multiple groups
Abstract Differential item functioning (DIF) can be investigated by estimating item response theory (IRT) parameters separately for different respondent groups, thus allowing for the detection of discrepancies in parameter estimates across groups. However, before comparing the estimates, it is necessary to convert them to a common metric due to the ...
Michela Battauz
wiley +1 more source
An encoding of argumentation problems using quadratic unconstrained binary optimization [PDF]
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems.
Santini, Francesco, Baioletti, Marco
core +1 more source
Computing Skinning Weights via Convex Duality
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev +14 more
wiley +1 more source
Establishing Shape Correspondences: A Survey
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
Strictly Conservative Neural Distance Fields
Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley +1 more source
MotionPyramid: Controllable Motion Synthesis via Stylized Phase Manifolds
Abstract We introduce stylized phase manifolds—a compact, interpretable latent representation that disentangles motion content (e.g. “jumping”, “walking”), the temporal structure (e.g. motion cycle frequency, gait timing), and style (i.e. how the motion is performed). Learned in an unsupervised manner and inherently low‐dimensional, the manifold offers
Jingyuan Li +3 more
wiley +1 more source
The Incentive Virtues of Performance‐Based Trade Allowances and Loss Leading
ABSTRACT A retailer can boost demand for a manufacturer's product through non‐verifiable activities. Performance‐based trade allowances—rebates conditional on the retailer's successful sales efforts—help mitigate this moral hazard problem. In equilibrium, the wholesale contract includes a retail price set below cost, complemented by a rebate for ...
David Martimort, Jérôme Pouyet
wiley +1 more source
Immunizing Conic Quadratic Optimization Problems Against Implementation Errors [PDF]
We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints.
Ben-Tal, A., Hertog, D. den
core

