Sciweavers

1162 search results - page 152 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
ASIAN
2007
Springer
102views Algorithms» more  ASIAN 2007»
14 years 2 months ago
A Static Birthmark of Binary Executables Based on API Call Structure
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
Seokwoo Choi, Heewan Park, Hyun-il Lim, Taisook Ha...
ICIP
1999
IEEE
14 years 9 months ago
Automatic Image Orientation Detection
Automatic detection and correction of image orientation is of great importance in intelligent image processing. In this paper, we present an automatic image orientation detection ...
Aditya Vailaya, HongJiang Zhang, Anil K. Jain
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 2 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
14 years 2 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
INFOVIS
2000
IEEE
14 years 14 days ago
Visualizing Massive Multi-Digraphs
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...
James Abello, Jeffrey L. Korn