Sciweavers

11565 search results - page 37 / 2313
» Computing Minimal Mappings
Sort
View
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 7 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
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 ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
DAGSTUHL
2006
13 years 8 months ago
Computation of the Minimal Associated Primes
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...
Santiago Laplagne
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
13 years 7 months ago
Computing the minimal covering set
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...
Felix Brandt, Felix A. Fischer
CAD
2005
Springer
13 years 7 months ago
Freeform surface flattening based on fitting a woven mesh model
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 ...
Charlie C. L. Wang, Kai Tang, Benjamin M. L. Yeung
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Minimal Complete Primitives for Secure Multi-party Computation
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...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...