761 search results - page 19 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
STOC
1998
ACM
13 years 12 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
DAWAK
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
NIPS
2004
13 years 9 months ago
2004
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...