Sciweavers

672 search results - page 43 / 135
» Words and forbidden factors
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
14 years 12 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
NIPS
2001
15 years 1 months ago
Fragment Completion in Humans and Machines
Partial information can trigger a complete memory. At the same time, human memory is not perfect. A cue can contain enough information to specify an item in memory, but fail to tr...
David Jacobs, Bas Rokers, Archisman Rudra, Zili Li...
CORR
2006
Springer
112views Education» more  CORR 2006»
14 years 12 months ago
Algorithms and Approaches of Proxy Signature: A Survey
Numerous research studies have been investigated on proxy signatures over the last decade. This survey reviews the research progress on proxy signatures, analyzes a few notable pr...
Manik Lal Das, Ashutosh Saxena, Deepak B. Phatak
IPL
2008
172views more  IPL 2008»
14 years 11 months ago
Approximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
Valentin Ziegler
IJFCS
2006
81views more  IJFCS 2006»
14 years 11 months ago
Combinatorial Properties of Sturmian Palindromes
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
Aldo de Luca, Alessandro De Luca