3874 search results - page 309 / 775 » Approximation Algorithms for k-hurdle Problems |
137
click to vote
IJCV
2006
15 years 4 months ago
2006
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
173
click to vote
MOBIHOC
2002
ACM
16 years 4 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...
140
click to vote
SAC
2010
ACM
15 years 11 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 ...
130
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
172
click to vote
ICIP
2008
IEEE
15 years 11 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...