Sciweavers

1089 search results - page 138 / 218
» Randomness and Reducibility
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Opportunistic Processing and Query of Motion Trajectories in Wireless Sensor Networks
—We study the problem of in-network processing and queries of trajectories of moving targets in a sensor network. The main idea is to exploit the spatial coherence of target traj...
Dengpan Zhou, Jie Gao
ASIACRYPT
2009
Springer
14 years 4 months ago
Improved Generic Algorithms for 3-Collisions
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...
Antoine Joux, Stefan Lucks
ESA
2009
Springer
104views Algorithms» more  ESA 2009»
14 years 4 months ago
Improved Approximation Algorithms for Label Cover Problems
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J...
IWCMC
2009
ACM
14 years 4 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach
GLOBECOM
2008
IEEE
14 years 4 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong