Sciweavers

9842 search results - page 1580 / 1969
» Problem complexity
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 1 months ago
Structure and Optimality of Myopic Sensing for Opportunistic Spectrum Access
We consider opportunistic spectrum access for secondary users over multiple channels whose occupancy by primary users is modeled as discrete-time Markov processes. Due to hardware...
Qing Zhao, Bhaskar Krishnamachari
ICC
2007
IEEE
106views Communications» more  ICC 2007»
16 years 1 months ago
Differential Space-Frequency Modulation and 2D-Detection for MIMO-OFDM
Abstract— In this paper differential space–frequency modulation (DSFM) for transmission over multiple–input multiple– output channels using orthogonal frequency division mu...
Volker Pauli, Lutz H.-J. Lampe, Johannes Huber
ICC
2007
IEEE
192views Communications» more  ICC 2007»
16 years 1 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
ICDCS
2007
IEEE
16 years 1 months ago
Combating Double-Spending Using Cooperative P2P Systems
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper...
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
16 years 1 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
« Prev « First page 1580 / 1969 Last » Next »