Sciweavers

1331 search results - page 188 / 267
» Complexity bounds for zero-test algorithms
Sort
View
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 9 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
PODC
2005
ACM
15 years 8 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
STACS
2005
Springer
15 years 8 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
ISPAN
1999
IEEE
15 years 7 months ago
Distributed Clustering for Ad Hoc Networks
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
Stefano Basagni
LATIN
2010
Springer
15 years 5 months ago
Lightweight Data Indexing and Compression in External Memory
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
Paolo Ferragina, Travis Gagie, Giovanni Manzini