129 search results - page 12 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
ALGORITHMICA
2002
13 years 8 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
SIBGRAPI
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Most of the existing works on space-time block codes (STBC) assume the channels are quasi-static, i.e., they remain invariant within one block. This assumption is not always tr...
BMVC
1998
13 years 9 months ago
1998
Autocalibration is a difficult problem. Not only is its computation very noisesensitive, but there also exist many critical motions that prevent the estimation of some of the came...
AAAI
2010
13 years 10 months ago
2010
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...