Sciweavers

3270 search results - page 356 / 654
» Approximate String Processing
Sort
View
ACRI
2006
Springer
15 years 7 months ago
Parallel Simulation of Asynchronous Cellular Automata Evolution
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as ...
Olga L. Bandman
114
Voted
FSMNLP
2005
Springer
15 years 6 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
114
Voted
CSCLP
2004
Springer
15 years 6 months ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
117
Voted
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
15 years 6 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
ICIP
2003
IEEE
15 years 6 months ago
Texture analysis: an adaptive probabilistic approach
Two main issues arise when working in the area of texture segmentation: the need to describe the texture accurately by capturing its underlying structure, and the need to perform ...
Karen Brady, Ian Jermyn, Josiane Zerubia