Sciweavers

3804 search results - page 77 / 761
» From Here to There
Sort
View
JUCS
2002
179views more  JUCS 2002»
15 years 5 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson
PAMI
2010
112views more  PAMI 2010»
15 years 4 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
BIOSYSTEMS
2007
72views more  BIOSYSTEMS 2007»
15 years 6 months ago
Parameter-free testing of the shape of a probability distribution
The Kolmogorov–Smirnov test determines the consistency of empirical data with a particular probability distribution. Often, parameters in the distribution are unknown, and have ...
M. Broom, P. Nouvellet, J. P. Bacon, D. Waxman
PROFES
2001
Springer
15 years 10 months ago
Augmenting Experience Reports with Lightweight Postmortem Reviews
Many small and medium-sized companies that develop software experience the same problems repeatedly, and have few systems in place to learn from their own mistakes as well as their...
Torgeir Dingsøyr, Nils Brede Moe, Øy...
ISMIR
2005
Springer
170views Music» more  ISMIR 2005»
15 years 11 months ago
Applications of Binary Classification and Adaptive Boosting to the Query-By-Humming Problem
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...
Charles L. Parker