2272 search results - page 33 / 455 » Capture Complexity by Partition |
108
Voted
COMPGEOM
1996
ACM
15 years 4 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
118
click to vote
AUTOMATICA
1999
15 years 7 days ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained...
116
Voted
IJCAI
2007
15 years 2 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
138
Voted
SIAMCOMP
1998
15 years 6 days ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...