Sciweavers

1389 search results - page 245 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
BMVC
2002
15 years 9 days ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
IJIT
2004
14 years 11 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
SMC
2007
IEEE
156views Control Systems» more  SMC 2007»
15 years 4 months ago
Dynamic fusion of classifiers for fault diagnosis
—This paper considers the problem of temporally fusing classifier outputs to improve the overall diagnostic classification accuracy in safety-critical systems. Here, we discuss d...
Satnam Singh, Kihoon Choi, Anuradha Kodali, Krishn...
BMCBI
2010
151views more  BMCBI 2010»
14 years 10 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon