3898 search results - page 310 / 780 » On the Bit Extraction Problem |
144
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
145
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
169
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
129
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract-- We consider the problem of two transmitters wishing to exchange information through a relay in the middle. The channels between the transmitters and the relay are assume...
110
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...