6110 search results - page 147 / 1222 » Approximate Computing |
198
click to vote
SOFSEM
2007
Springer
16 years 16 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
156
click to vote
FOCS
2006
IEEE
16 years 14 days ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
138
click to vote
POLICY
2005
Springer
15 years 12 months ago
2005
Springer
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
168
click to vote
CA
2002
IEEE
15 years 11 months ago
2002
IEEE
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
177
click to vote
RT
1999
Springer
15 years 10 months ago
1999
Springer
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...