Sciweavers

2312 search results - page 67 / 463
» Invariance in Property Testing
Sort
View
ACSC
2004
IEEE
14 years 1 months ago
Strength Reduction for Loop-Invariant Types
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
Phung Hua Nguyen, Jingling Xue
PAMI
2007
214views more  PAMI 2007»
13 years 9 months ago
2D Affine-Invariant Contour Matching Using B-Spline Model
—This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the nonuniqueness of B-Spline in curve matching. This metho...
Yue Wang, Eam Khwang Teoh
ICALP
2001
Springer
14 years 2 months ago
Testing Hypergraph Coloring
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
Artur Czumaj, Christian Sohler
SIGSOFT
2002
ACM
14 years 10 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira