Sciweavers

12265 search results - page 105 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
AAAI
1996
13 years 11 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
TSP
2008
121views more  TSP 2008»
13 years 10 months ago
Stochastic Analysis of the LMS Algorithm for System Identification With Subspace Inputs
This paper studies the behavior of the low-rank least mean squares (LMS) adaptive algorithm for the general case in which the input transformation may not capture the exact input s...
Neil J. Bershad, José Carlos M. Bermudez, J...
MOC
2000
104views more  MOC 2000»
13 years 9 months ago
Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
Charles H. Tong, Qiang Ye
ICPP
1999
IEEE
14 years 2 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
FUIN
2011
358views Cryptology» more  FUIN 2011»
13 years 1 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...