4797 search results - page 50 / 960 » The complexity of partition tasks |
ISMVL
2005
IEEE
14 years 2 months ago
2005
IEEE
In digital signal processing, we often use higher radix system to achieve high-speed computation. In such cases, we require radix converters. This paper considers the design of LU...
COMPGEOM
1996
ACM
14 years 1 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...
AUTOMATICA
1999
13 years 8 months 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...
IAT
2005
IEEE
14 years 2 months ago
2005
IEEE
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
ICIP
2005
IEEE
14 years 10 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...