2137 search results - page 400 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
141
click to vote
INFORMS
1998
15 years 1 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
224
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
114
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
119
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
112
click to vote
NIPS
2007
15 years 3 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...