Sciweavers

49 search results - page 4 / 10
» Optimal sampling from sliding windows
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Linear approximations for rate control in video coding
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
Yegnaswamy Sermadevi, Sheila S. Hemami
TIP
2008
113views more  TIP 2008»
13 years 7 months ago
Phase Local Approximation (PhaseLa) Technique for Phase Unwrap From Noisy Data
The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in o...
Vladimir Katkovnik, Jaakko Astola, Karen O. Egiaza...
ENVSOFT
2007
88views more  ENVSOFT 2007»
13 years 7 months ago
Resampling-based software for estimating optimal sample size
The SISSI program implements a novel approach for the estimation of the optimal sample size in experimental data collection. It provides avisual evaluation system of sample size d...
Roberto Confalonieri, Marco Acutis, Gianni Bellocc...
SIGIR
2011
ACM
12 years 10 months ago
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
Ferhan Ture, Tamer Elsayed, Jimmy J. Lin
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
14 years 26 days ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...