447 search results - page 43 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
107
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
168
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
119
Voted
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
116
Voted
SODA
2010
ACM
15 years 2 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
132
Voted
AAAI
2004
15 years 5 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...