941 search results - page 23 / 189 » Efficient Testing of Large Graphs |
70
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
AIME
2009
Springer
15 years 1 months ago
2009
Springer
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
86
Voted
UAI
2008
14 years 11 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
86
Voted
SIGCOMM
1992
ACM
15 years 1 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...