Sciweavers

1369 search results - page 120 / 274
» Lattice computations for random numbers
Sort
View
CIS
2005
Springer
14 years 2 months ago
An Improved EMASK Algorithm for Privacy-Preserving Frequent Pattern Mining
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
Congfu Xu, Jinlong Wang, Hongwei Dan, Yunhe Pan
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
14 years 2 months 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
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 2 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
CVIU
2006
76views more  CVIU 2006»
13 years 9 months ago
Homeostatic image perception: An artificial system
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
Thomas Feldman, Laurent Younes
JCM
2007
78views more  JCM 2007»
13 years 9 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