Sciweavers

941 search results - page 20 / 189
» Efficient Testing of Large Graphs
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
14 years 9 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
OOPSLA
1997
Springer
15 years 1 months ago
Efficient Type Inclusion Tests
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
Jan Vitek, R. Nigel Horspool, Andreas Krall
SIGSOFT
2007
ACM
15 years 10 months ago
Quantifying the effectiveness of testing via efficient residual path profiling
Software testing is extensively used for uncovering bugs in large, complex software. Testing relies on well designed regression test suites that anticipate all reasonable software...
Trishul M. Chilimbi, Aditya V. Nori, Kapil Vaswani
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 6 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
ICIP
2010
IEEE
14 years 7 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...