13603 search results - page 123 / 2721 » On the Computational Complexity of Cut-Reduction |
174
Voted
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
164
click to vote
BMVC
2010
15 years 4 months ago
2010
We propose a novel directed graphical model for label propagation in lengthy and complex video sequences. Given hand-labelled start and end frames of a video sequence, a variation...
144
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
166
click to vote
JAIR
2011
15 years 1 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
160
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...