6480 search results - page 184 / 1296 » Proximity Communication and Time |
139
click to vote
CG
2007
Springer
15 years 6 months ago
2007
Springer
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
184
click to vote
JIPS
2007
15 years 6 months ago
2007
: Mobile technology appears promising as a method to promote group performance in circumstances dependent on time, but not member proximity. However, the success of mobile technolo...
201
click to vote
COMGEO
2000
ACM
15 years 6 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
196
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
178
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...