1503 search results - page 98 / 301 » Detecting Anomalies in Graphs |
145
click to vote
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
168
click to vote
IJDAR
2006
15 years 4 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
102
click to vote
NIPS
2003
15 years 5 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
113
click to vote
AICT
2006
IEEE
15 years 10 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
135
click to vote
ZEUS
2010
15 years 5 months ago
2010
Control-flow analysis of business process models requires to check the absence of lack of synchronization. We use workflow graphs, which may contain inclusive OR gateways, to repre...