Sciweavers

793 search results - page 5 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ICONS
2008
IEEE
14 years 1 months ago
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
Giray Kömürcü, Erkay Savas
FASE
2009
Springer
13 years 11 months ago
Accurate and Efficient Structural Characteristic Feature Extraction for Clone Detection
Abstract. Structure-oriented approaches in clone detection have become popular in both code-based and model-based clone detection. However, existing methods for capturing structura...
Hoan Anh Nguyen, Tung Thanh Nguyen, Nam H. Pham, J...
ICMCS
2007
IEEE
169views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Identifying Computer Graphics using HSV Color Model and Statistical Moments of Characteristic Functions
Computer graphics generated by advanced rendering software come to appear so photorealistic that it has become difficult for people to visually differentiate them from photographi...
Wen Chen, Yun Q. Shi, Guorong Xuan
ATAL
2011
Springer
12 years 7 months ago
Concise characteristic function representations in coalitional games based on agent types
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makot...
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
14 years 1 months ago
Hardware Acceleration of the Tate Pairing in Characteristic Three
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
Philipp Grabher, Dan Page