Sciweavers

8728 search results - page 144 / 1746
» On Reduct Construction Algorithms
Sort
View
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 5 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
AAAI
2010
15 years 2 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
IWCMC
2006
ACM
15 years 7 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
ICPR
2004
IEEE
16 years 2 months ago
Missing Microarray Data Estimation Based on Projection onto Convex Sets Method
DNA microarrays have gained widespread uses in biological studies. Missing values in a microarray experiment must be estimated before further analysis. In this paper, we propose a...
Alan Wee-Chung Liew, Hong Yan, Xiangchao Gan
IEEECGIV
2009
IEEE
15 years 7 months ago
Monomial Forms for Curves in CAGD with their Applications
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
Chanon Aphirukmatakun, Natasha Dejdumrong