Sciweavers

2783 search results - page 310 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ECCC
2007
96views more  ECCC 2007»
15 years 1 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
98
Voted
KI
2008
Springer
15 years 1 months ago
Space, Time, and the Use of Language
1 The investigation of linguistic expressions of space and time typically presupposes an interdependency between these two related conceptual domains, resulting in a quasi-metaphor...
Thora Tenbrink
JOLLI
2006
101views more  JOLLI 2006»
15 years 1 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
JSAC
2006
101views more  JSAC 2006»
15 years 1 months ago
Distributed space-time coding for multihop transmission in power line communication networks
In this paper, we consider transmission in relatively wide-stretched power line communication (PLC) networks, where repeaters are required to bridge the source-to-destination dista...
Lutz H.-J. Lampe, Robert Schober, Simon Yiu
107
Voted
MOR
2008
110views more  MOR 2008»
15 years 1 months ago
Alternating Projections on Manifolds
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...
Adrian S. Lewis, Jérôme Malick