Sciweavers

2994 search results - page 230 / 599
» Time sequences
Sort
View
ICASSP
2008
IEEE
15 years 11 months ago
Implementation of message-passing algorithms for the acquisition of spreading codes
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
Massimo Rovini, Fabio Principe, Luca Fanucci, Marc...
INFOCOM
2006
IEEE
15 years 10 months ago
A Quasi-Species Approach for Modeling the Dynamics of Polymorphic Worms
— Polymorphic worms can change their byte sequence as they replicate and propagate, thwarting the traditional signature analysis techniques used by many intrusion detection syste...
Bradley Stephenson, Biplab Sikdar
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 10 months ago
On Adaptive Integer Sorting
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys...
Anna Pagh, Rasmus Pagh, Mikkel Thorup
SOFSEM
2009
Springer
15 years 9 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo
TPDS
1998
118views more  TPDS 1998»
15 years 4 months ago
Optimizing Computing Costs Using Divisible Load Analysis
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi