351 search results - page 64 / 71 » Algebra and Geometry of Rewriting |
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
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...
87
Voted
PKC
2000
Springer
15 years 3 months ago
2000
Springer
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...
108
click to vote
WSC
2007
15 years 2 months ago
2007
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...
108
Voted
EGITALY
2006
15 years 1 months ago
2006
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 ...
83
Voted
DAGSTUHL
2003
15 years 1 months ago
2003
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...