91 search results - page 13 / 19 » The Data Stream Space Complexity of Cascaded Norms |
107
click to vote
COCO
2003
Springer
15 years 4 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
GRAPHICSINTERFACE
2009
14 years 9 months ago
2009
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
PODS
2006
ACM
15 years 11 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
ATMOS
2008
15 years 1 months ago
2008
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...