11565 search results - page 37 / 2313 » Computing Minimal Mappings |
104
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
DAGSTUHL
2006
15 years 3 months ago
2006
Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation o...
128
click to vote
MSS
2008
IEEE
15 years 1 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
158
click to vote
CAD
2005
Springer
15 years 1 months ago
2005
Springer
This paper presents a robust and efficient surface flattening approach based on fitting a woven-like mesh model on a 3D freeform surface. The fitting algorithm is based on tendon ...
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...