6110 search results - page 299 / 1222 » Approximate Computing |
161
click to vote
ICCS
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
155
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
152
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bo...
135
click to vote
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we describe a new method to map a texture on a surface with a spatially-variant filter. Our filter takes into consideration the effects of anisotropy using a Jaco...
164
click to vote
MP
1998
15 years 6 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...