Sciweavers

163 search results - page 30 / 33
» Optimal Correspondences from Pairwise Constraints
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
BMCBI
2008
84views more  BMCBI 2008»
13 years 7 months ago
poolHiTS: A Shifted Transversal Design based pooling strategy for high-throughput drug screening
Background: A key goal of drug discovery is to increase the throughput of small molecule screens without sacrificing screening accuracy. High-throughput screening (HTS) in drug di...
Raghunandan M. Kainkaryam, Peter J. Woolf
BMCBI
2008
144views more  BMCBI 2008»
13 years 7 months ago
Local conservation scores without a priori assumptions on neutral substitution rates
Background: Comparative genomics aims to detect signals of evolutionary conservation as an indicator of functional constraint. Surprisingly, results of the ENCODE project revealed...
Janis Dingel, Pavol Hanus, Niccolò Leonardi...
ECCV
2006
Springer
14 years 9 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
ICCV
1999
IEEE
13 years 11 months ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...