29908 search results - page 458 / 5982 » On the Complexity of |
188
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
208
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—New air interfaces are currently being developed to meet the high spectral efficiency requirements of the emerging wireless communication systems. In this context, OFDM is cons...
168
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
162
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
175
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...