1998 search results - page 76 / 400 » Complexity of the Cover Polynomial |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
VR
1993
IEEE
14 years 2 months ago
1993
IEEE
Screen space rendering statistics were gathered from 150 3D objects, each modeled by between 2K and 40K triangles. While there is wide variance by individual object, the overall t...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
TAMC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...