Sciweavers

100 search results - page 20 / 20
» Coloring powers of planar graphs
Sort
View
TIT
2010
174views Education» more  TIT 2010»
12 years 12 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
ICYCS
2008
IEEE
13 years 11 months ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
ā€” Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen
CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 5 months ago
Evolution of National Nobel Prize Shares in the 20th Century
We analyze the evolution of cumulative national shares of Nobel Prizes since 1901, properly taking into account that most prizes were divided among several laureates. We rank by c...
Jürgen Schmidhuber
JAIR
2007
132views more  JAIR 2007»
13 years 5 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliļ¬...
Chu Min Li, Felip Manyà, Jordi Planes
ICTAI
2009
IEEE
13 years 3 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux