725 search results - page 39 / 145 » Bounding Degrees on RPL |
JMLR
2010
14 years 4 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
AAECC
2003
Springer
15 years 2 months ago
2003
Springer
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
JSC
2010
14 years 8 months ago
2010
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
103
Voted
ISITA
2010
14 years 4 months ago
2010
We consider the Binary Erasure Source (BES) introduced by Martinian and Yedidia. Based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion p...
WDAG
2000
Springer
15 years 1 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...