740 search results - page 141 / 148 » Lower bounds for Buchsbaum* complexes |
157
click to vote
RT
2004
Springer
15 years 11 months ago
2004
Springer
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
158
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
248
Voted
STOC
1993
ACM
15 years 9 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
212
click to vote
DATAMINE
2006
15 years 5 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
178
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...