Sciweavers

351 search results - page 64 / 71
» Algebra and Geometry of Rewriting
Sort
View
COMPGEOM
2004
ACM
14 years 3 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 1 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
WSC
2007
14 years 3 days ago
Flexible modeling of linear schedules for integrated mathematical analysis
Developing and analyzing schedules is essential for successfully controlling the time aspect of construction projects. The critical path method of scheduling is by far the most wi...
Gunnar Lucko
EGITALY
2006
13 years 11 months ago
Implementing mesh-based approaches for deformable objects on GPU
These latest years witnessed an impressive improvement of graphics hardware both in terms of features and in terms of computational power. This improvement can be easily observed ...
Guido Ranzuglia, Paolo Cignoni, Fabio Ganovelli, R...
DAGSTUHL
2003
13 years 11 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...