Sciweavers

870 search results - page 81 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 2 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...
METRICS
2005
IEEE
15 years 3 months ago
Metrics of Software Architecture Changes Based on Structural Distance
Software architecture is an important form of abstraction, representing the overall system structure and the relationship among components. When software is modified from one ver...
Taiga Nakamura, Victor R. Basili
ASIAN
2007
Springer
102views Algorithms» more  ASIAN 2007»
15 years 4 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...
UAI
2008
14 years 11 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
INFOCOM
2010
IEEE
14 years 8 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...