Sciweavers

947 search results - page 55 / 190
» Discrete Geometry
Sort
View
COCOA
2008
Springer
14 years 11 months ago
Automatic Generation of Symmetry-Breaking Constraints
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
Leo Liberti
COCOA
2008
Springer
14 years 11 months ago
Magic Labelings on Cycles and Wheels
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
Andrew Baker, Joe Sawada
DGCI
2011
Springer
14 years 1 months ago
Some Morphological Operators on Simplicial Complex Spaces
In this work, we propose a framework that allows to build morphological operators for processing and filtering objects defined on t) simplicial complex spaces. We illustrate with...
Fabio Dias, Jean Cousty, Laurent Najman
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
15 years 1 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
COMPUTING
2007
126views more  COMPUTING 2007»
14 years 9 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...