29908 search results - page 359 / 5982 » On the Complexity of |
190
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
191
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
175
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
193
Voted
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
We have developed a scalable image compression scheme with a good performance-complexity trade-off. Like JPEG, it is based on the 8 × 8 block discrete cosine transform (DCT), but...
205
Voted
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...