Sciweavers

2485 search results - page 57 / 497
» Time Bounded Frequency Computations
Sort
View
CORR
2002
Springer
117views Education» more  CORR 2002»
13 years 10 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
14 years 10 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 10 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
CORR
2008
Springer
53views Education» more  CORR 2008»
13 years 10 months ago
An ESPRIT-based approach for Initial Ranging in OFDMA systems
Abstract--In this letter, an initial ranging scheme for orthogonal frequency-division multiple-access systems is proposed by which users that intend to establish a communication li...
Luca Sanguinetti, Michele Morelli, H. Vincent Poor
WCNC
2008
IEEE
14 years 4 months ago
Estimation of Interference-Free Transmit Power for Opportunistic Spectrum Access
Abstract— We consider a scenario in which frequency agile radios opportunistically share a fixed spectrum resource with a set of primary nodes. We develop a collaborative scheme...
Brian L. Mark, Ahmed O. Nasif