186 search results - page 28 / 38 » Fast Computation of Sparse Datacubes |
VIS
2007
IEEE
14 years 11 months ago
2007
IEEE
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
PKDD
2001
Springer
14 years 2 months ago
2001
Springer
In some domains, Information Extraction (IE) from texts requires syntactic and semantic parsing. This analysis is computationally expensive and IE is potentially noisy if it applie...
JCP
2008
13 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Proportionate-type affine projection algorithms (PAPAs) are very attractive choices for echo cancellation. These algorithms combine the good features (convergence and tracking) o...
CGF
2002
13 years 9 months ago
2002
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and...