563 search results - page 49 / 113 » Computing approximate PSD factorizations |
149
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper proposes a method to compute the likelihood function for the amplitudes and phase shifts of noisily observed phase-locked and amplitude-constrained sinusoids. The sinus...
142
click to vote
ALGORITHMICA
2011
14 years 9 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
217
click to vote
EMMCVPR
2011
Springer
14 years 2 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
140
click to vote
JACM
2012
13 years 4 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
143
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...