Sciweavers

1705 search results - page 60 / 341
» Representing Constraints with Automata
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
Multiplicative update rules for nonnegative matrix factorization with co-occurrence constraints
Nonnegative matrix factorization (NMF) is a widely-used tool for obtaining low-rank approximations of nonnegative data such as digital images, audio signals, textual data, financ...
Steven K. Tjoa, K. J. Ray Liu
ACRI
2006
Springer
14 years 4 months ago
CA Models of Myxobacteria Swarming
We develop two models for Myxobacteria swarming, a modified Lattice Gas Cellular Automata (LGCA) model and an off-lattice CA model. In the LGCA model each cell is represented by on...
Yilin Wu, Nan Chen, Matthew Rissler, Yi Jiang, Dal...
ASWEC
2006
IEEE
14 years 4 months ago
A Runtime Monitoring and Validation Framework for Web Service Interactions
Web services are designed for composition and use by third parties through dynamic discovery. As such, the issue of interoperability between services is of great importance to ens...
Zheng Li, Yan Jin, Jun Han
ICDAR
2003
IEEE
14 years 3 months ago
Handwritten Word Recognition based on Structural Characteristics and Lexical Support
In this paper a handwritten recognition algorithm based on structural characteristics, histograms and profiles, is presented. The well-known horizontal and vertical histograms are...
Ergina Kavallieratou, Kyriakos N. Sgarbas, Nikos F...
AUSAI
2006
Springer
14 years 1 months ago
Heyting Domains for Constraint Abduction
Abstract. We investigate constraint domains in which answers to constraint abduction problems can be represented compactly by a most general answer. We demonstrate several classes ...
Michael J. Maher