1469 search results - page 138 / 294 » Approximate polynomial decomposition |
155
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
133
click to vote
RT
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a technique, based on pre-computed light transport and separable BRDF approximation, for interactive rendering of non-diffuse objects under all-frequency envir...
147
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
193
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
149
Voted
SIAMMAX
2010
14 years 11 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...