Sciweavers

1632 search results - page 265 / 327
» On special numberings of hypergraphs
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
Wei Wang, Martin J. Wainwright, Kannan Ramchandran
DAM
2008
114views more  DAM 2008»
15 years 6 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
JSAC
2006
109views more  JSAC 2006»
15 years 6 months ago
Polarized MIMO channels in 3-D: models, measurements and mutual information
4G systems are expected to support data rates of the order of 100 Mbps in the outdoor environment and 1 Gbps in the indoor/stationary environment. In order to support such large p...
Mansoor Shafi, Min Zhang, Aris L. Moustakas, Peter...
ML
2006
ACM
15 years 6 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
MP
2006
138views more  MP 2006»
15 years 6 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...