Sciweavers

21183 search results - page 24 / 4237
» Adaptive Testing by Test
Sort
View
156
Voted
ECCV
2006
Springer
16 years 5 months ago
Random Walks, Constrained Multiple Hypothesis Testing and Image Enhancement
Image restoration is a keen problem of low level vision. In this paper, we propose a novel - assumption-free on the noise model - technique based on random walks for image enhancem...
Noura Azzabou, Nikos Paragios, Frederic Guichard
149
Voted
DEXAW
2007
IEEE
92views Database» more  DEXAW 2007»
15 years 10 months ago
Subtree Testing and Closed Tree Mining Through Natural Representations
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
José L. Balcázar, Albert Bifet, Anto...
115
Voted
CSMR
2003
IEEE
15 years 9 months ago
Using Observation and Refinement to Improve Distributed Systems Test
Testing a distributed system is difficult. Good testing depends on both skill and understanding the system under test. We have developed a method to observe the system at the CORB...
Johan Moe, David A. Carr, Mikael Patel
125
Voted
ISSTA
2006
ACM
15 years 9 months ago
Coverage metrics for requirements-based testing
In black-box testing, one is interested in creating a suite of tests from requirements that adequately exercise the behavior of a software system without regard to the internal st...
Michael W. Whalen, Ajitha Rajan, Mats Per Erik Hei...
109
Voted
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
15 years 9 months ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman