Sciweavers

2996 search results - page 174 / 600
» Numberings and Randomness
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Subspace compressive detection for sparse signals
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
Zhongmin Wang, Gonzalo R. Arce, Brian M. Sadler
ICIP
2008
IEEE
16 years 29 days ago
Compressed sensing for multi-view tracking and 3-D voxel reconstruction
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
Dikpal Reddy, Aswin C. Sankaranarayanan, Volkan Ce...
INFOCOM
2009
IEEE
16 years 1 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
WCNC
2010
IEEE
15 years 10 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh