165 search results - page 9 / 33 » The theory of multidimensional persistence |
113
Voted
DCC
1995
IEEE
15 years 3 months ago
1995
IEEE
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
109
Voted
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
90
Voted
KR
2004
Springer
15 years 5 months ago
2004
Springer
To support commonsense reasoning about space, we require a qualitative calculus of spatial entities and their relations. One requirement for such a calculus, which has not so far ...
105
click to vote
DMDW
2001
15 years 1 months ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...