Sciweavers

3604 search results - page 465 / 721
» All Common Subsequences
Sort
View
CISC
2006
Springer
81views Cryptology» more  CISC 2006»
15 years 10 months ago
Return Address Randomization Scheme for Annuling Data-Injection Buffer Overflow Attacks
Buffer overflow(BOF) has been the most common form of vulnerability in software systems today, and many methods exist to defend software systems against BOF attacks. Among them, th...
Deok Jin Kim, Tae Hyung Kim, Jong Kim, Sung Je Hon...
EUROPAR
2004
Springer
15 years 10 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
COCOON
2006
Springer
15 years 10 months ago
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
Sheung-Hung Poon
FPGA
2004
ACM
234views FPGA» more  FPGA 2004»
15 years 10 months ago
An embedded true random number generator for FPGAs
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
Paul Kohlbrenner, Kris Gaj
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 10 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...