Sciweavers

1695 search results - page 5 / 339
» Linear, Polynomial or Exponential
Sort
View
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 1 months ago
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
Georg Gottlob, Thomas Schwentick
CASES
2004
ACM
14 years 3 months 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...
ASIACRYPT
2008
Springer
13 years 11 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
GMP
2006
IEEE
107views Solid Modeling» more  GMP 2006»
14 years 3 months ago
A New Class of Non-stationary Interpolatory Subdivision Schemes Based on Exponential Polynomials
We present a new class of non-stationary, interpolatory subdivision schemes that can exactly reconstruct parametric surfaces including exponential polynomials. The subdivision rule...
Yoo-Joo Choi, Yeon Ju Lee, Jungho Yoon, Byung-Gook...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle