Sciweavers

951 search results - page 31 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
ACG
2009
Springer
15 years 4 months ago
Monte-Carlo Kakuro
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
Tristan Cazenave
TCS
2008
14 years 10 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
COMPGEOM
2006
ACM
15 years 4 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
CC
2002
Springer
126views System Software» more  CC 2002»
14 years 10 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
IDA
2010
Springer
14 years 8 months ago
Three alternative combinatorial formulations of the theory of evidence
In this paper we introduce three alternative combinatorial formulations of the theory of evidence (ToE), by proving that both plausibility and commonality functions share the stru...
Fabio Cuzzolin