5595 search results - page 486 / 1119 » Approximation Algorithms for Clustering Problems |
235
click to vote
MOBIHOC
2002
ACM
16 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
202
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
229
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
229
click to vote
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...
233
click to vote
DAM
2011
15 years 2 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...