ARESEC
2011
12 years 4 months ago
2011
—The Operational Complexity Model (OCM) has been used to derive the complexities of the five most prevalent cyber-crimes occurring in southeast Asia, namely peer-to-peer (P2P) mu...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
HPCC
2007
Springer
13 years 10 months ago
2007
Springer
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
ICIP
2007
IEEE
13 years 11 months ago
2007
IEEE
A complexity model for motion compensation in the H.264/AVC decoder is proposed. This model considers a rich set of inter prediction modes allowed by H.264 as well as the relation...
ICIP
2008
IEEE
14 years 6 months ago
2008
IEEE
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...