Sciweavers

253 search results - page 28 / 51
» Principal Graphs and Manifolds
Sort
View
116
Voted
ISI
2004
Springer
15 years 6 months ago
Studying E-Mail Graphs for Intelligence Monitoring and Analysis in the Absence of Semantic Information
Abstract. This work describes a methodology that can be used to identify structure and communication patterns within an organization based on e-mail data. The first step of the me...
Petros Drineas, Mukkai S. Krishnamoorthy, Michael ...
119
Voted
OOPSLA
1999
Springer
15 years 5 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
119
Voted
EM
2010
155views Management» more  EM 2010»
15 years 24 days ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
95
Voted
SE
2010
15 years 2 months ago
Towards Information Flow Auditing in Workflows
: The paper proposes an approach for compliance audits in workflow environments based on the tracking of information flow. Requirements are formalized as a binary relation on the w...
Claus Wonnemann
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
15 years 26 days ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas