Sciweavers

3105 search results - page 384 / 621
» The Path-Packing Structure of Graphs
Sort
View
ACISP
1998
Springer
15 years 10 months ago
Detecting Key-Dependencies
The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposu...
Tage Stabell-Kulø, Arne Helme, Gianluca Din...
GD
1998
Springer
15 years 10 months ago
Improved Force-Directed Layouts
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
Emden R. Gansner, Stephen C. North
IFIP
1992
Springer
15 years 10 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
CANDT
2009
15 years 10 months ago
Measuring self-focus bias in community-maintained knowledge repositories
Self-focus is a novel way of understanding a type of bias in community-maintained Web 2.0 graph structures. It goes beyond previous measures of topical coverage bias by encapsulat...
Brent Hecht, Darren Gergle
DASC
2006
IEEE
15 years 10 months ago
Automated Caching of Behavioral Patterns for Efficient Run-Time Monitoring
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
Natalia Stakhanova, Samik Basu, Robyn R. Lutz, Joh...