Sciweavers

103 search results - page 2 / 21
» A separation theorem in property testing
Sort
View
ENTCS
2007
72views more  ENTCS 2007»
13 years 7 months ago
Observational Equivalence for the Interaction Combinators and Internal Separation
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
Damiano Mazza
ICASSP
2008
IEEE
14 years 1 months ago
Some properties of an empirical mode type signal decomposition algorithm
The empirical mode decomposition (EMD) has seen widespread use for analysis of nonlinear and nonstationary time-series. Despite some practical success, it lacks a firm theoretica...
Stephen D. Hawley, Les E. Atlas, Howard J. Chizeck
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 2 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
ENTCS
2008
104views more  ENTCS 2008»
13 years 7 months ago
A Logic for Virtual Memory
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing ...
Rafal Kolanski
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
13 years 11 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu