Sciweavers

1310 search results - page 53 / 262
» On a Class of Traceability Codes
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 7 months ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
CVPR
2007
IEEE
14 years 9 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
GRC
2009
IEEE
13 years 11 months ago
A step toward code granulation space
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
Yinliang Zhao
IJNSEC
2008
83views more  IJNSEC 2008»
13 years 7 months ago
Java Mobile Code Dynamic Verification by Bytecode Modification for Host Confidentiality
In this paper we present a novel dynamic verification approach to protect the local host confidentiality from malicious Java mobile code. In our approach we use Bytecode Modificat...
Dan Lu, Yoshitake Kobayashi, Ken Nakayama, Mamoru ...
ICIP
1997
IEEE
14 years 9 months ago
Minimum-Entropy Clustering and its Application to Lossless Image Coding
The Minimum-Entropy Clustering (MEC) algorithm proposed in this paper provides an optimal method for addressing the non-stationarity of a source with respect to entropy coding. Th...
Farshid Golchin, Kuldip K. Paliwal