1813 search results - page 156 / 363 » Calculi of Approximation Spaces |
196
click to vote
ICC
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
202
click to vote
ICCS
2007
Springer
16 years 18 days ago
2007
Springer
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
171
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
179
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
148
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...