129 search results - page 12 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
103
Voted
ALGORITHMICA
2002
14 years 11 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...
121
click to vote
SIBGRAPI
2006
IEEE
15 years 5 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 ...
104
click to vote
ICC
2007
IEEE
15 years 6 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...
78
Voted
BMVC
1998
15 years 1 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
15 years 1 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...