7930 search results - page 265 / 1586 » Greedy in Approximation Algorithms |
174
click to vote
SBBD
2003
15 years 8 months ago
2003
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
164
click to vote
FCCM
2008
IEEE
15 years 6 months ago
2008
IEEE
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
242
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...
175
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
167
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
The paper describes the architecture of Brown University’s agent, Botticelli, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM,...