Sciweavers

Share
TOG
2012
237views Communications» more  TOG 2012»
8 years 24 days ago
An algebraic model for parameterized shape editing
We present an approach to high-level shape editing that adapts the structure of the shape while maintaining its global characteristics. Our main contribution is a new algebraic mo...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel, V...
JMLR
2012
8 years 24 days ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
8 years 10 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
ICCV
2011
IEEE
8 years 10 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
IJAR
2011
86views more  IJAR 2011»
9 years 1 months ago
On open questions in the geometric approach to structural learning Bayesian nets
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
Milan Studený, Jirí Vomlel
GIS
2011
ACM
9 years 1 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
JMMA
2002
90views more  JMMA 2002»
9 years 10 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
JSAT
2006
108views more  JSAT 2006»
9 years 10 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
CONSTRAINTS
2008
117views more  CONSTRAINTS 2008»
9 years 10 months ago
Domain Specific High-Level Constraints for User Interface Layout
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...
Christof Lutteroth, Robert Strandh, Gerald Weber
IJCAI
2001
9 years 11 months ago
Constraints as Data: A New Perspective on Inferring Probabilities
We present a new approach to inferring a probability distribution which is incompletely specified by a number of linear constraints. We argue that the currently most popular appro...
Manfred Jaeger
books