564 search results - page 20 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
116
click to vote
APLAS
2010
ACM
14 years 8 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
BMCBI
2006
14 years 9 months ago
2006
Background: Quantitative simultaneous monitoring of the expression levels of thousands of genes under various experimental conditions is now possible using microarray experiments....
AAAI
2011
13 years 9 months ago
2011
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
CSL
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...