8825 search results - page 315 / 1765 » All for one or one for all |
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper we present an alternative separable implementation of L2 -orthogonal space-time codes (STC) for continuous phase modulation (CPM). In this approach, we split the STC...
95
Voted
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
122
Voted
ICSM
2009
IEEE
15 years 8 months ago
2009
IEEE
Nowadays, programmers spend much of their workday dealing with code libraries and frameworks that are bloated with APIs. One common way of interacting with APIs is through Code Co...
118
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
111
Voted
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...