Sciweavers

3457 search results - page 274 / 692
» A Symbol Is Not a Symbol
Sort
View
FSTTCS
2008
Springer
15 years 7 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
ICASSP
2010
IEEE
15 years 6 months ago
Optimal gain control for single-carrier communications with uniform quantization at the receiver
The achievable rate of digital communications systems can strongly depend on the analog-to-digital conversion at the receiver. It is hence important to adjust the gain control at ...
Stefan Krone, Gerhard Fettweis
GLOBECOM
2008
IEEE
15 years 6 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 6 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
COGSCI
2008
51views more  COGSCI 2008»
15 years 6 months ago
Perceptual Processing Affects Conceptual Processing
According to the Perceptual Symbols Theory of cognition (Barsalou, 1999), modality-specific simulations underlie the representation of concepts. A strong prediction of this view i...
Saskia Van Dantzig, Diane Pecher, René Zeel...