7129 search results - page 360 / 1426 » Approximation Algorithms for Treewidth |
128
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper applies a recently developed neural network called plausible neural network (PNN) to function approximation. Instead of using error correction, PNN estimates the mut...
121
click to vote
ANSS
2005
IEEE
15 years 10 months ago
2005
IEEE
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
134
click to vote
CONIELECOMP
2005
IEEE
15 years 10 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
162
Voted
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
122
click to vote
SPIRE
1999
Springer
15 years 9 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...