4924 search results - page 266 / 985 » Efficiency Improvement for NTRU |
186
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
248
click to vote
VLDB
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
180
click to vote
CGF
2006
15 years 6 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
152
click to vote
IJSWIS
2008
15 years 6 months ago
2008
The requirement for ubiquitous service access in wireless environments presents a great challenge in light of well known problems like high error rate and frequent disconnections....