Sciweavers

2069 search results - page 145 / 414
» Linear time algorithms for Clobber
Sort
View
ESANN
2008
15 years 6 months ago
A Regularized Learning Method for Neural Networks Based on Sensitivity Analysis
The Sensitivity-Based Linear Learning Method (SBLLM) is a learning method for two-layer feedforward neural networks, based on sensitivity analysis, that calculates the weights by s...
Bertha Guijarro-Berdiñas, Oscar Fontenla-Ro...
CAV
1998
Springer
98views Hardware» more  CAV 1998»
15 years 8 months ago
Verification of Timed Systems Using POSETs
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Wendy Belluomini, Chris J. Myers
ISAAC
2004
Springer
91views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
Qingmin Shi, Joseph JáJá
SPIRE
2010
Springer
15 years 2 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 months ago
Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
Vincent Yan Fu Tan, Vivek K. Goyal