2414 search results - page 131 / 483 » Computing Normal Subgroups |
TLCA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
SIBGRAPI
2003
IEEE
14 years 2 months ago
2003
IEEE
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The o...
FCT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
SIBGRAPI
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper presents a simple and robust algorithm for estimating the local geometric properties of intersection curves, namely the tangent, normal, binormal, curvature and torsion ...
DCC
1993
IEEE
14 years 1 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...