Sciweavers

84 search results - page 9 / 17
» On the Number of Pseudo-Triangulations of Certain Point Sets
Sort
View
CCA
2009
Springer
13 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 21 days ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
CASES
2004
ACM
14 years 27 days ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
FOCS
2002
IEEE
14 years 13 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 1 months ago
Interactive evolutionary multi-objective optimization and decision-making using reference direction method
In this paper, we borrow the concept of reference direction approach from the multi-criterion decision-making literature and combine it with an EMO procedure to develop an algorit...
Kalyanmoy Deb, Abhishek Kumar