4850 search results - page 529 / 970 » Approximate Data Structures with Applications |
204
Voted
ICCV
2005
IEEE
16 years 25 days ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
179
click to vote
DCOSS
2005
Springer
16 years 23 days ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
190
click to vote
AAAI
1997
15 years 8 months ago
1997
Tools for mining information from data can create added value for the Internet. As the majority of electronic documents available over the network are in unstructured textual form...
194
click to vote
CGF
2010
15 years 7 months ago
2010
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
215
click to vote
EGH
2009
Springer
15 years 5 months ago
2009
Springer
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...