Sciweavers

6393 search results - page 305 / 1279
» Randomized Algorithms on the Mesh
Sort
View
CGF
2006
191views more  CGF 2006»
15 years 6 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
TC
2010
15 years 5 months ago
Design and Analysis of On-Chip Networks for Large-Scale Cache Systems
—Switched networks have been adopted in on-chip communication for their scalability and efficient resource sharing. However, using a general network for a specific domain may res...
Yuho Jin, Eun Jung Kim, Ki Hwan Yum
ICDM
2003
IEEE
126views Data Mining» more  ICDM 2003»
15 years 12 months ago
Interpretations of Association Rules by Granular Computing
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...
Yuefeng Li, Ning Zhong
153
Voted
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 11 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
15 years 12 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...