Sciweavers

2996 search results - page 192 / 600
» Numberings and Randomness
Sort
View
ASIACRYPT
2000
Springer
15 years 10 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
JCM
2007
78views more  JCM 2007»
15 years 6 months ago
Blind CFO Estimators for OFDM/OQAM Systems With Null Subcarriers
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...
Tilde Fusco, Mario Tanda
ACCV
2009
Springer
16 years 1 months ago
Interactive Super-Resolution through Neighbor Embedding
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
Jian Pu, Junping Zhang, Peihong Guo, Xiaoru Yuan
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
16 years 3 days ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee
ICRA
2003
IEEE
139views Robotics» more  ICRA 2003»
15 years 12 months ago
Mobile robot localization with an incomplete map in non-stationary environments
— One of the fundamental problems of the mobile robots is self-localization, i.e. to estimate the self-position by comparing sensor data and a map. In non-stationary environments...
Kanji Tanaka, Tsutomu Hasegawa, Hongbin Zha, Eiji ...