Sciweavers

2018 search results - page 288 / 404
» Magnitude-preserving ranking algorithms
Sort
View
HIS
2004
15 years 7 months ago
K-Ranked Covariance Based Missing Values Estimation for Microarray Data Classification
Microarray data often contains multiple missing genetic expression values that degrade the performance of statistical and machine learning algorithms. This paper presents a K rank...
Muhammad Shoaib B. Sehgal, Iqbal Gondal, Laurence ...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 7 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
CORR
2008
Springer
216views Education» more  CORR 2008»
15 years 6 months ago
Building an interpretable fuzzy rule base from data using Orthogonal Least Squares Application to a depollution problem
In many fields where human understanding plays a crucial role, such as bioprocesses, the capacity of extracting knowledge from data is of critical importance. Within this framewor...
Sébastien Destercke, Serge Guillaume, Brigi...
PAMI
2008
185views more  PAMI 2008»
15 years 6 months ago
Three-View Multibody Structure from Motion
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
René Vidal, Richard Hartley