Sciweavers

ACSC
2006
IEEE
14 years 5 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson
ACSC
2006
IEEE
14 years 5 months ago
SPiKE: engineering malware analysis tools using unobtrusive binary-instrumentation
Malware — a generic term that encompasses viruses, trojans, spywares and other intrusive code — is widespread today. Malware analysis is a multi-step process providing insight...
Amit Vasudevan, Ramesh Yerraballi
ACSC
2006
IEEE
14 years 5 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
ACSC
2006
IEEE
14 years 5 months ago
A JMX toolkit for merging network management systems
The ever increasing size of networks has resulted in a corresponding escalation of administration costs and lengthy deployment cycles. Clearly, more scalable and flexible network...
Feng Lu, Kris Bubendorfer
ACSC
2006
IEEE
14 years 5 months ago
Throughput fairness in k-ary n-cube networks
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered ...
Cruz Izu

0
posts
with
0
views
28profile views
SciweaversLibrarian
Sciweavers
WG
2007
Springer
14 years 5 months ago
Characterization and Recognition of Digraphs of Bounded Kelly-width
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
Daniel Meister, Jan Arne Telle, Martin Vatshelle
WG
2007
Springer
14 years 5 months ago
Monotonicity of Non-deterministic Graph Searching
Frédéric Mazoit, Nicolas Nisse
WG
2007
Springer
14 years 5 months ago
Obtaining a Planar Graph by Vertex Deletion
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
Dániel Marx, Ildikó Schlotter
WG
2007
Springer
14 years 5 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey