Sciweavers

19320 search results - page 403 / 3864
» On the complexity of computing determinants
Sort
View
TSP
2008
101views more  TSP 2008»
15 years 6 months ago
Reduced-Complexity Soft MIMO Detection Based on Causal and Noncausal Decision Feedback
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...
Yong Li, Jaekyun Moon
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
15 years 5 months ago
Complexity of Safe Strategic Voting
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...
Noam Hazon, Edith Elkind
BMVC
2010
15 years 4 months ago
Label propagation in complex video sequences using semi-supervised learning
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...
Ignas Budvytis, Vijay Badrinarayanan, Roberto Cipo...
CORR
2011
Springer
186views Education» more  CORR 2011»
15 years 1 months ago
On the Complexity of Solving a Bivariate Polynomial System
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...
Pavel Emeliyanenko, Michael Sagraloff
JAIR
2011
123views more  JAIR 2011»
15 years 1 months ago
The Complexity of Integer Bound Propagation
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...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...