Sciweavers

1763 search results - page 254 / 353
» Dependent random choice
Sort
View
BMCBI
2008
123views more  BMCBI 2008»
13 years 8 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
BMCBI
2008
122views more  BMCBI 2008»
13 years 8 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
AICOM
2006
129views more  AICOM 2006»
13 years 8 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
IOR
2006
91views more  IOR 2006»
13 years 8 months ago
Robust One-Period Option Hedging
The paper considers robust optimization to cope with uncertainty about the stock return process in one period option hedging problems. The robust approach relates portfolio choice ...
Frank Lutgens, Jos F. Sturm, Antoon Kolen
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 8 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...