Sciweavers

189 search results - page 16 / 38
» Interpolation of Functions Related to the Integer Factoring ...
Sort
View

Publication
289views
12 years 5 months ago
An Analysis of Finite Volume, Finite Element, and Finite Difference Methods Using Some Concepts from Algebraic Topology
In this paper we apply the ideas of algebraic topology to the analysis of the finite volume and finite element methods, illuminating the similarity between the discretization str...
Claudio Mattiussi
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
ECAI
1998
Springer
13 years 11 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
ALGOSENSORS
2008
Springer
13 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
ICALP
1990
Springer
13 years 11 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...