10608 search results - page 483 / 2122 » Complexity of O'Hara's Algorithm |
181
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
148
click to vote
INFOVIS
2003
IEEE
15 years 10 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
145
click to vote
RT
1998
Springer
15 years 9 months ago
1998
Springer
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
135
Voted
CORR
2010
Springer
15 years 3 hour ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
133
click to vote
CGF
2004
15 years 4 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...