19320 search results - page 146 / 3864 » On the complexity of computing determinants |
139
Voted
JMM2
2007
15 years 4 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
131
Voted
CCCG
2003
15 years 6 months ago
2003
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
93
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We determine set-theoretic defining equations for the variety Dualk,d,N P(Sd CN ) of hypersurfaces of degree d in CN that have dual variety of dimension at most k. We apply these ...
143
click to vote
CLUSTER
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper we give a theoretical model for determining the synchronization frequency that minimizes the parallel execution time of loops with uniform dependencies dynamicall...
129
Voted
ACCV
1998
Springer
15 years 9 months ago
1998
Springer
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...