Sciweavers

2111 search results - page 15 / 423
» Understanding the Yarowsky Algorithm
Sort
View
JUCS
2002
179views more  JUCS 2002»
13 years 10 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
CVPR
2009
IEEE
15 years 4 months ago
Tracking of Cell Populations to Understand their Spatio-Temporal Behavior in Response to Physical Stimuli
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...
David House, Matthew Walker, Zheng Wu, Joyce Wong,...
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
14 years 4 months ago
Toward a better understanding of rule initialisation and deletion
A number of heuristics have been used in Learning Classifier Systems to initialise parameters of new rules, to adjust fitness of parent rules when they generate offspring, and ...
Tim Kovacs, Larry Bull
CSFW
2003
IEEE
14 years 3 months ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
SP
1998
IEEE
106views Security Privacy» more  SP 1998»
14 years 2 months ago
Understanding Java Stack Inspection
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
Dan S. Wallach, Edward W. Felten