Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

This paper addresses the problem of 3D human pose estimation from a single image. We follow a standard two-step pipeline by first…

Highly Cited

2016

Highly Cited

2016

The all-pairs-similarity-search (or similarity join) problem has been extensively studied for text and a handful of other…

Highly Cited

2013

Highly Cited

2009

Review

2006

Review

2006

Many machine learning algorithms, such as K Nearest Neighbor (KNN), heavily rely on the distance metric for the input data…

Highly Cited

2001

Highly Cited

2001

Nonparametric multivariate analysis of ecological data using permutation tests has two main challenges: (1) to partition the…

Highly Cited

1999

Highly Cited

1999

Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP…

Highly Cited

1993

Highly Cited

1993

Euclidean Distance Matrix Analysis (EDMA) of form is a coordinate free approach to the analysis of form using landmark data. In…

Highly Cited

1985

Highly Cited

1985

This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance…

Highly Cited

1960

Highly Cited

1960

It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems…