Sciweavers

141 search results - page 18 / 29
» Shape Analysis with Reference Set Relations
Sort
View
POPL
2008
ACM
16 years 3 hour ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
DATE
2008
IEEE
103views Hardware» more  DATE 2008»
15 years 6 months ago
A Mutation Model for the SystemC TLM 2.0 Communication Interfaces
Mutation analysis is a widely-adopted strategy in software testing with two main purposes: measuring the quality of test suites, and identifying redundant code in programs. Simila...
Nicola Bombieri, Franco Fummi, Graziano Pravadelli
POPL
2010
ACM
15 years 9 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
ICDAR
2009
IEEE
14 years 9 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
BMCBI
2010
153views more  BMCBI 2010»
14 years 11 months ago
Challenges in microarray class discovery: a comprehensive examination of normalization, gene selection and clustering
Background: Cluster analysis, and in particular hierarchical clustering, is widely used to extract information from gene expression data. The aim is to discover new classes, or su...
Eva Freyhult, Mattias Landfors, Jenny Önskog,...