1489 search results - page 38 / 298 » Optimizing Feature Sets for Structured Data |
CGF
2008
14 years 9 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
FIMI
2003
14 years 11 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
The majority of methods available to recover 3D structure from video assume that a set of feature points are tracked across a large number of frames. This is not always possible i...