951 search results - page 105 / 191 » On the Computation of Correctly-Rounded Sums |
154
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
167
click to vote
PSIVT
2007
Springer
15 years 10 months ago
2007
Springer
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
135
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
159
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
154
click to vote
PODS
1999
ACM
15 years 8 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...