1554 search results - page 99 / 311 » Parameterized Complexity and Approximation Algorithms |
129
Voted
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose an iterative receiver for horizontally encoded MIMO systems like the PARC proposal for MIMOHSDPA. Our receiver uses a K-best-MAP demodulator to provide the channel d...
158
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
141
click to vote
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
166
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
145
Voted
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a...