Sciweavers

3270 search results - page 312 / 654
» Approximate String Processing
Sort
View
ICA
2012
Springer
14 years 2 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
NLP
2000
15 years 10 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
IPPS
2009
IEEE
16 years 1 months ago
Crash fault detection in celerating environments
Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known “eventually perfect” failure detector, 3P...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
IJCNN
2007
IEEE
16 years 22 days ago
Neurolinguistic Approach to Vector Representation of Medical Concepts
Abstract—Putative brain processes responsible for understanding language are based on spreading activation in semantic networks, providing enhanced representations that involve c...
Wlodzislaw Duch, Pawel Matykiewicz, John Pestian
ICONIP
1998
15 years 7 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann