Sciweavers

71 search results - page 10 / 15
» Decomposition Techniques for Subgraph Matching
Sort
View
TSE
2008
113views more  TSE 2008»
13 years 7 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
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...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang
WCRE
2009
IEEE
14 years 2 months ago
The Logical Modularity of Programs
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...
Daniel Ratiu, Radu Marinescu, Jan Jürjens
STACS
2009
Springer
14 years 2 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
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...
Kenya Ueno
DCC
2010
IEEE
14 years 2 months ago
Block Compressed Sensing of Images Using Directional Transforms
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
Sungkwang Mun, James E. Fowler
BMCBI
2008
119views more  BMCBI 2008»
13 years 8 months ago
A new method for 2D gel spot alignment: application to the analysis of large sample sets in clinical proteomics
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
Sabine Pérès, Laurence Molina, Nicol...