1327 search results - page 146 / 266 » Path following algorithm for the graph matching problem |
131
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
133
click to vote
SIGCOMM
2010
ACM
15 years 4 months ago
2010
ACM
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in ma...
155
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
145
click to vote
CVPR
2011
IEEE
15 years 1 days ago
2011
IEEE
Recognizing faces in unconstrained videos is a task of mounting importance. While obviously related to face recognition in still images, it has its own unique characteristics and ...
122
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...