Sciweavers

648 search results - page 21 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
145
Voted
ICANN
2007
Springer
16 years 16 days ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
180
Voted
CNSR
2007
IEEE
104views Communications» more  CNSR 2007»
16 years 21 days ago
Performance Analysis of Web Service Replica Selection in an Extranet
Providing web service replicas improves the overall system performance and redundancy for hardware failures. In Business-to-Business, this may be particularly interesting for orga...
Partheeban Chandrasekaran, Shikharesh Majumdar, Ch...
146
Voted
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 10 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
175
Voted
BMCBI
2008
142views more  BMCBI 2008»
15 years 6 months ago
Genetic weighted k-means algorithm for clustering large-scale gene expression data
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
Fang-Xiang Wu
204
Voted
ICASSP
2011
IEEE
14 years 10 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...