337 search results - page 53 / 68 » Semidefinite Programming Based Approximation Algorithms |
PLDI
2003
ACM
14 years 23 days ago
2003
ACM
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
NIPS
2007
13 years 9 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 ...
PVM
2004
Springer
14 years 26 days ago
2004
Springer
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
DAGSTUHL
2007
13 years 9 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
IJON
2007
13 years 7 months ago
2007
In this paper, a ridgelet kernel regression model is proposed for approximation of high dimensional functions. It is based on ridgelet theory, kernel and regularization technology ...