Sciweavers

455 search results - page 44 / 91
» On Trees and Noncrossing Partitions
Sort
View
APCHI
2008
IEEE
14 years 2 months ago
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
Inyoung Shin, Moonseong Kim, Hyunseung Choo
BMCBI
2004
181views more  BMCBI 2004»
13 years 7 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
WWW
2005
ACM
14 years 8 months ago
WAND: a meta-data maintenance system over the internet
WAND is a meta-data management system that provides a file-system tree for users of an internet based P2P network. The tree is robust and retains its structure even when nodes (pe...
Anubhav Bhatia, Saikat Mukherjee, Saugat Mitra, Sr...
ICCAD
2006
IEEE
132views Hardware» more  ICCAD 2006»
14 years 1 months ago
Clock buffer polarity assignment for power noise reduction
Abstract—Power/ground noise is a major source of VLSI circuit timing variations. This work aims to reduce clock network induced power noise by assigning different signal polariti...
Rupak Samanta, Ganesh Venkataraman, Jiang Hu
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
13 years 9 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens