Sciweavers

7380 search results - page 175 / 1476
» time 2008
Sort
View
FOCS
2008
IEEE
16 years 28 days ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
GLOBECOM
2008
IEEE
16 years 28 days ago
Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
Feifei Gao, Arumugam Nallanathan, Chintha Tellambu...
GLOBECOM
2008
IEEE
16 years 28 days ago
Opportunity Detection for OFDMA Systems with Timing Misalignment
— Accurate detection of spectrum opportunities within the frequency band of an orthogonal frequency division multiple access (OFDMA) system is a critical requirement for the real...
Mustafa E. Sahin, Ismail Güvenç, Moo-R...
ICC
2008
IEEE
121views Communications» more  ICC 2008»
16 years 28 days ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
16 years 27 days ago
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
Leman Akoglu, Mary McGlohon, Christos Faloutsos