Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,715,655 papers from all fields of science
Search
Sign In
Create Free Account
Fastest
Fastest is a model-based testing tool that works with specifications written in the Z notation. The tool implements () the Test Template Framework…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Community Z Tools
Interface (Java)
LaTeX
Model-based testing
Expand
Broader (1)
Z notation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A Fully Constrained Linear Spectral Unmixing Algorithm Based on Distance Geometry
Hanye Pu
,
W. Xia
,
Bin Wang
,
Geng-Ming Jiang
IEEE Transactions on Geoscience and Remote…
2014
Corpus ID: 22754034
Under the linear spectral mixture model, hyperspectral unmixing can be considered as a convex geometry problem, in which the…
Expand
2012
2012
Automatic Test Data Generation for Software Path Testing Using Evolutionary Algorithms
Gentiana Ioana Latiu
,
O. Creţ
,
L. Văcariu
Third International Conference on Emerging…
2012
Corpus ID: 17802726
Software testing is a very expensive and time consuming process. Test methods which generate test data based on the program's…
Expand
2011
2011
An Efficient Algorithm for Generating Classification Rules
S. Vijayarani
,
M. Divya
2011
Corpus ID: 17698272
Data mining is the process of extracting hidden knowledge from the large data repositories. In data mining, there are several…
Expand
2011
2011
Overlapping Community Structures and Their Detection on Social Networks
Nam P. Nguyen
,
Thang N. Dinh
,
Dung T. Nguyen
,
M. Thai
IEEE Third Int'l Conference on Privacy, Security…
2011
Corpus ID: 14824494
We propose DOCA (Detecting Overlapping Community Algorithm), a connection-based algorithm for discovering high quality…
Expand
2008
2008
Fast computation of the median by successive binning
R. Tibshirani
arXiv.org
2008
Corpus ID: 6284034
This paper describes a new median algorithm and a median approximation algorithm. The former has O(n) average running time and…
Expand
2008
2008
A New and Efficient Algorithm to Binarize Document Images Removing Back-to-Front Interference
J. G. M. Silva
,
R. Lins
,
Fernando Mário Junqueira Martins
,
R. Wachenchauzer
Journal of universal computer science (Online)
2008
Corpus ID: 1918260
Back-to-front interference", "bleeding" and "show-through" is the name given to the phenomenon found whenever documents are…
Expand
2007
2007
End-to-End Available Bandwidth Measurement Tools : A Comparative Evaluation of Performances
A. A. Ali
,
F. Michaut
,
F. Lepage
arXiv.org
2007
Corpus ID: 14728677
In recent years, there has been a strong interest in measuring the available bandwidth of network paths. Several methods and…
Expand
Highly Cited
2001
Highly Cited
2001
A Long-Term View of Short-Range Wireless
D. Leeper
Computer
2001
Corpus ID: 39871329
Economic forces and physical laws are driving the growth of a new wireless infrastructure that will become as ubiquitous as…
Expand
1998
1998
Direct pattern matching on compressed text
E. Moura
,
G. Navarro
,
N. Ziviani
,
Ricardo Baeza-Yates
Proceedings. String Processing and Information…
1998
Corpus ID: 9211458
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be…
Expand
1992
1992
A small test generator for large designs
S. Kundu
,
L. Huisman
,
Indira Nair
,
V. Iyengar
,
L. N. Reddy
Proceedings International Test Conference
1992
Corpus ID: 10390999
We report an automatic test pattern generator that can handle designs with one million gates or more on medium size workstations…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE