Sciweavers

184 search results - page 18 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 8 months ago
On some deterministic dictionaries supporting sparsity
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
ADHOCNOW
2008
Springer
14 years 3 months ago
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
David Peleg, Liam Roditty
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
13 years 8 months ago
Recursive Algorithms of Time Series Observations Recognition
Abstract. The paper presents new method for sequential classification of the time series observations. Methods and algorithms of sequential recognition are obtained on the basis of...
Edward Shpilewski
DAC
2003
ACM
14 years 1 months ago
Model order reduction of nonuniform transmission lines using integrated congruence transform
This paper presents a new algorithm based on Integrated Congruence transform for the analysis of both uniform and nonuniform transmission lines. The key advantage of the proposed ...
Emad Gad, Michel S. Nakhla
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain