7930 search results - page 63 / 1586 » Greedy in Approximation Algorithms |
142
Voted
RSP
1999
IEEE
15 years 7 months ago
1999
IEEE
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
128
Voted
DAWAK
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
139
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
129
Voted
COLOGNETWENTE
2008
15 years 4 months ago
2008
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
161
Voted
PAMI
2011
14 years 9 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...