Sciweavers

2018 search results - page 129 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CRISIS
2009
15 years 7 months ago
Modeling dependencies in security risk management
This paper develops a framework for analyzing security risk dependencies in organizations and ranking the risks. The framework captures how risk `diffuses' via complex interac...
Tansu Alpcan, Nicholas Bambos
BMCBI
2007
149views more  BMCBI 2007»
15 years 6 months ago
A unified framework for finding differentially expressed genes from microarray experiments
Background: This paper presents a unified framework for finding differentially expressed genes (DEGs) from the microarray data. The proposed framework has three interrelated modul...
Jahangheer S. Shaik, Mohammed Yeasin
IJAC
2008
97views more  IJAC 2008»
15 years 6 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
CORR
2002
Springer
118views Education» more  CORR 2002»
15 years 6 months ago
Unsupervised discovery of morphologically related words based on orthographic and semantic similarity
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to di...
Marco Baroni, Johannes Matiasek, Harald Trost
ICML
2006
IEEE
16 years 7 months ago
Bayesian pattern ranking for move prediction in the game of Go
We investigate the problem of learning to predict moves in the board game of Go from game records of expert players. In particular, we obtain a probability distribution over legal...
David H. Stern, Ralf Herbrich, Thore Graepel