909 search results - page 90 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
115
click to vote
NAACL
2010
14 years 11 months ago
2010
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
126
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
Semantic service discovery architectures that operate in mobile environments must cope with the significant challenges of finding relevant services rapidly, while facing constrain...
HICSS
2006
IEEE
15 years 7 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
100
click to vote
ASUNAM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
155
click to vote
CPM
2004
Springer
15 years 6 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...