Sciweavers

147 search results - page 14 / 30
» Optimization and Simplification of Hierarchical Clusterings
Sort
View
ITIIS
2010
151views more  ITIIS 2010»
13 years 5 months ago
Practical Data Transmission in Cluster-Based Sensor Networks
Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient ...
Dae Young Kim, Jinsung Cho, Byeong-Soo Jeong
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
IPPS
2000
IEEE
13 years 11 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 7 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
WSCG
2004
149views more  WSCG 2004»
13 years 8 months ago
Shape-Preserving Parametrization of Genus 0 Surfaces
The parametrization of 3-d meshes can be used in many fields of computer graphics. Mesh-texturing, mesh-retriangulation or 3-d morphing are only few applications for which a mesh ...
Hermann Birkholz