Sciweavers

1421 search results - page 10 / 285
» Algorithms for subsequence combinatorics
Sort
View
4OR
2006
100views more  4OR 2006»
14 years 9 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
ICIP
1998
IEEE
15 years 11 months ago
A Combinatorical Approach to Vector Tomography for Doppler Spectral Data
Velocity spectra of a flow can be made by ultrasound Doppler measurements. Using only part of the information in these spectra, it is possible to reconstruct the solenoid part and...
Kent Stråhlén
DCG
2008
93views more  DCG 2008»
14 years 9 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 9 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
CORR
2008
Springer
142views Education» more  CORR 2008»
14 years 9 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau