1279 search results - page 146 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
132
click to vote
TSP
2011
14 years 8 months ago
2011
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
103
click to vote
AAAI
2007
15 years 4 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
144
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
108
click to vote
DAM
2007
15 years 1 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...