Sciweavers

2477 search results - page 205 / 496
» Approximate extended formulations
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 4 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
JSAC
2008
91views more  JSAC 2008»
15 years 4 months ago
A novel receiver architecture for single-carrier transmission over time-varying channels
In this paper, we present a single-carrier transceiver for rapidly time-varying channels, where the equalization step is implemented in the frequency domain. When the channel abide...
Zijian Tang, Geert Leus
JCO
2006
103views more  JCO 2006»
15 years 4 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
140
Voted
ICIP
2010
IEEE
15 years 2 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard
JSAC
2011
126views more  JSAC 2011»
14 years 11 months ago
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...
Chee Wei Tan, S. Friedland, Steven H. Low