176 search results - page 5 / 36 » Unbalanced Points and Vertices Problem |
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
MICS
2010
14 years 7 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
SODA
1996
ACM
14 years 10 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
SODA
2000
ACM
14 years 10 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
123
click to vote
Publication
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...