16404 search results - page 2923 / 3281 » A set coverage problem |
169
click to vote
VISUALIZATION
1998
IEEE
15 years 11 months ago
1998
IEEE
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
196
click to vote
SIGCOMM
1998
ACM
15 years 11 months ago
1998
ACM
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
202
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
217
click to vote
COCOON
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
190
click to vote
SIGMOD
1997
ACM
15 years 11 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...