337 search results - page 10 / 68 » Semidefinite Programming Based Approximation Algorithms |
AMC
2008
14 years 11 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
144
Voted
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
101
click to vote
PAMI
2007
14 years 11 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
KDD
2004
ACM
16 years 2 days ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...