Sciweavers

520 search results - page 62 / 104
» Reductions Between Expansion Problems
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
13 years 9 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 3 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
JMLR
2012
11 years 11 months ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...
COLT
1999
Springer
14 years 1 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
CVPR
2010
IEEE
13 years 11 months ago
Learning 3D Shape from a Single Facial Image via Non-linear Manifold Embedding and Alignment
The 3D reconstruction of a face from a single frontal image is an ill-posed problem. This is further accentuated when the face image is captured under different poses and/or compl...
Xianwang Wang, Ruigang Yang