Sciweavers

2735 search results - page 10 / 547
» Comparing notions of randomness
Sort
View
DCC
2010
IEEE
13 years 7 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
EWSN
2006
Springer
14 years 7 months ago
Sensor Density for Complete Information Coverage in Wireless Sensor Networks
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
ICASSP
2011
IEEE
12 years 11 months ago
Comparative threshold performance study for conditional and unconditional direction-of-arrival estimation
Comparative analysis of the threshold SNR and/or sample support values where genuine maximum likelihood DOA estimation starts to produce “outliers” is conducted for unconditio...
Yuri I. Abramovich, Ben A. Johnson
INFOCOM
2009
IEEE
14 years 2 months ago
Alpha Coverage: Bounding the Interconnection Gap for Vehicular Internet Access
—Vehicular Internet access via open WLAN access points (APs) has been demonstrated to be a feasible solution to provide opportunistic data service to moving vehicles. Using an in...
Zizhan Zheng, Prasun Sinha, Santosh Kumar
ECCC
1998
80views more  ECCC 1998»
13 years 7 months ago
Extracting All the Randomness from a Weakly Random Source
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
Salil P. Vadhan