16843 search results - page 98 / 3369 » On Generalized Authorization Problems |
APPROX
2006
Springer
13 years 12 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
NIPS
2001
13 years 9 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
STOC
2010
ACM
14 years 9 days ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
IIWAS
2003
13 years 9 months ago
2003
In this paper the analogy between biological swarms and artificial multiagent systems is pointed out. As an example the steps required to model the artificial optimization techniq...