Sciweavers

256 search results - page 24 / 52
» A practical comparison of two K-Means clustering algorithms
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 5 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
BMCBI
2008
114views more  BMCBI 2008»
15 years 1 months ago
Partial mixture model for tight clustering of gene expression time-course
Background: Tight clustering arose recently from a desire to obtain tighter and potentially more informative clusters in gene expression studies. Scattered genes with relatively l...
Yinyin Yuan, Chang-Tsun Li, Roland Wilson
ICIP
2006
IEEE
16 years 2 months ago
Computation Error Tolerance in Motion Estimation Algorithms
In this paper we study the computation error tolerance properties of motion estimation algorithms. We are motivated by two scenarios where hardware systems may introduce computati...
Hye-Yeon Cheong, In Suk Chong, Antonio Ortega
INFOCOM
2009
IEEE
15 years 8 months ago
A Localized Multi-Hop Desynchronization Algorithm for Wireless Sensor Networks
Abstract—This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor netw...
Hui Kang, Jennifer L. Wong
ICITA
2005
IEEE
15 years 6 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak