Sciweavers

437 search results - page 82 / 88
» Randomized Lattice Decoding
Sort
View
CSDA
2007
105views more  CSDA 2007»
14 years 11 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 3 months ago
A Stochastic-Geometry Approach to Coverage in Cellular Networks with Multi-Cell Cooperation
—Multi-cell cooperation is a promising approach for mitigating inter-cell interference in dense cellular networks. Quantifying the performance of multi-cell cooperation is challe...
Kaibin Huang, Jeffrey G. Andrews
ISPA
2005
Springer
15 years 4 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 5 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 3 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman