Sciweavers

1132 search results - page 100 / 227
» Similarity Graphs
Sort
View
PLDI
1994
ACM
15 years 2 months ago
On Slicing Programs with Jump Statements
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
Hiralal Agrawal
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 11 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 10 months ago
Data Reduction in Intrusion Alert Correlation
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
Gianni Tedesco, Uwe Aickelin
DAM
2007
79views more  DAM 2007»
14 years 10 months ago
Necessary conditions for multistationarity in discrete dynamical systems
R. Thomas conjectured, twenty years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of severa...
Adrien Richard, Jean-Paul Comet
METRICS
1999
IEEE
15 years 2 months ago
Measuring Coupling and Cohesion: An Information-Theory Approach
The design of software is often depicted by graphs that show components and their relationships. For example, a structure chart shows the calling relationships among components. O...
Edward B. Allen, Taghi M. Khoshgoftaar