Sciweavers

388 search results - page 43 / 78
» A Lattice-Based Approach to Hierarchical Clustering
Sort
View
ACIVS
2008
Springer
15 years 1 months ago
Efficient and Flexible Cluster-and-Search for CBIR
Content-Based Image Retrieval is a challenging problem both in terms of effectiveness and efficiency. In this paper, we present a flexible cluster-and-search approach that is able ...
Anderson Rocha, Jurandy Almeida, Mario A. Nascimen...
SAC
2005
ACM
15 years 5 months ago
Node clustering based on link delay in P2P networks
Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks i...
Wei Zheng, Sheng Zhang, Yi Ouyang, Fillia Makedon,...
CGF
1998
127views more  CGF 1998»
14 years 11 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
VLDB
1997
ACM
175views Database» more  VLDB 1997»
15 years 3 months ago
STING: A Statistical Information Grid Approach to Spatial Data Mining
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
Wei Wang 0010, Jiong Yang, Richard R. Muntz
CGF
2010
165views more  CGF 2010»
14 years 10 months ago
Hierarchical Structure Recovery of Point-Sampled Surfaces
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...
Marco Attene, Giuseppe Patanè