Sciweavers

4698 search results - page 668 / 940
» Making Functionality More General
Sort
View
TSP
2010
15 years 1 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
ICASSP
2011
IEEE
14 years 10 months ago
An approximate Minimum MOSPA estimator
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
David Frederic Crouse, Peter Willett, Marco Guerri...
CTRSA
2012
Springer
229views Cryptology» more  CTRSA 2012»
14 years 2 months ago
Practical Realisation and Elimination of an ECC-Related Software Bug Attack
We analyse and exploit implementation features in OpenSSL version 0.9.8g which permit an attack against ECDH-based functionality. The attack, although more general, can recover the...
Billy Bob Brumley, Manuel Barbosa, Dan Page, Frede...
MOBIHOC
2012
ACM
13 years 9 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
TOG
2012
221views Communications» more  TOG 2012»
13 years 9 months ago
Gabor noise by example
Procedural noise is a fundamental tool in Computer Graphics. However, designing noise patterns is hard. In this paper, we present Gabor noise by example, a method to estimate the ...
Bruno Galerne, Ares Lagae, Sylvain Lefebvre, Georg...