71 search results - page 10 / 15 » Decomposition Techniques for Subgraph Matching |
108
click to vote
TSE
2008
15 years 3 months ago
2008
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
126
Voted
WCRE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
126
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
128
click to vote
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
137
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...