438 search results - page 28 / 88 » A (1-1 e)-approximation algorithm for the generalized assign... |
GBRPR
2005
Springer
14 years 1 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
CCS
2009
ACM
14 years 2 months ago
2009
ACM
Role mining algorithms address an important access control problem: configuring a role-based access control system. Given a direct assignment of users to permissions, role mining...
ECCC
2007
13 years 7 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
ISPD
1997
ACM
13 years 12 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...