5169 search results - page 557 / 1034 » Locality approximation using time |
212
click to vote
AAECC
2006
Springer
15 years 7 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
197
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
In this paper, we analyze a general multiple-microphone and singleloudspeaker system, where an adaptive algorithm is used to cancel acoustic feedback/echo and a beamformer process...
212
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
225
click to vote
ACCV
2007
Springer
16 years 1 months ago
2007
Springer
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
216
click to vote
VTC
2007
IEEE
16 years 1 months ago
2007
IEEE
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...