Sciweavers

BMCBI
2006
120views more  BMCBI 2006»
13 years 11 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
IAJIT
2008
115views more  IAJIT 2008»
13 years 11 months ago
Optimal Fuzzy Clustering in Overlapping Clusters
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...
Ouafae Ammor, Abdelmounim Lachkar, Khadija Slaoui,...
BMCBI
2006
142views more  BMCBI 2006»
13 years 11 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins
BMCBI
2006
119views more  BMCBI 2006»
13 years 11 months ago
Utilization of two sample t-test statistics from redundant probe sets to evaluate different probe set algorithms in GeneChip stu
Background: The choice of probe set algorithms for expression summary in a GeneChip study has a great impact on subsequent gene expression data analysis. Spiked-in cRNAs with know...
Zihua Hu, Gail R. Willsky
FOCM
2008
140views more  FOCM 2008»
13 years 11 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil
EOR
2008
93views more  EOR 2008»
13 years 11 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
EOR
2008
90views more  EOR 2008»
13 years 11 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ALMOB
2006
80views more  ALMOB 2006»
13 years 11 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
AI
2006
Springer
13 years 11 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
AHSWN
2006
148views more  AHSWN 2006»
13 years 11 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...