Sciweavers

1299 search results - page 24 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
ICCV
2011
IEEE
13 years 8 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
AAAI
2010
14 years 11 months ago
Cost-Sensitive Semi-Supervised Support Vector Machine
In this paper, we study cost-sensitive semi-supervised learning where many of the training examples are unlabeled and different misclassification errors are associated with unequa...
Yu-Feng Li, James T. Kwok, Zhi-Hua Zhou
BMCBI
2011
14 years 1 months ago
PhyloMap: an algorithm for visualizing relationships of large sequence data sets and its application to the influenza A virus ge
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
Jiajie Zhang, Amir Madany Mamlouk, Thomas Martinet...
ICCV
2011
IEEE
13 years 9 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
96
Voted
CASES
2010
ACM
14 years 7 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra