446 search results - page 40 / 90 » Extremal Stable Graphs |
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
114
click to vote
TCOS
2010
14 years 10 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
110
click to vote
SRDS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
WWW
2009
ACM
16 years 15 days ago
2009
ACM
The emergence of Semantic Web technologies and standards such as Resource Description Framework (RDF) has introduced novel data storage models such as the RDF Graph Model. In this...
103
click to vote
POS
1994
Springer
15 years 3 months ago
1994
Springer
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...