Sciweavers

2229 search results - page 237 / 446
» Comparative analysis of biclustering algorithms
Sort
View
116
Voted
BMCBI
2007
123views more  BMCBI 2007»
15 years 21 days ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
BMCBI
2004
158views more  BMCBI 2004»
15 years 17 days ago
Improvement of alignment accuracy utilizing sequentially conserved motifs
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...
84
Voted
MICCAI
2009
Springer
16 years 1 months ago
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid,...
VLDB
2007
ACM
260views Database» more  VLDB 2007»
16 years 28 days ago
Approaching the Skyline in Z Order
Given a set of multidimensional data points, skyline query retrieves a set of data points that are not dominated by any other points. This query is useful for multi-preference ana...
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chie...
105
Voted
ICASSP
2009
IEEE
15 years 7 months ago
RLS-weighted Lasso for adaptive estimation of sparse signals
The batch least-absolute shrinkage and selection operator (Lasso) has well-documented merits for estimating sparse signals of interest emerging in various applications, where obse...
Daniele Angelosante, Georgios B. Giannakis