Sciweavers

740 search results - page 100 / 148
» Lower bounds for Buchsbaum* complexes
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 6 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
CSL
2006
Springer
15 years 10 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 9 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka
JMMA
2010
90views more  JMMA 2010»
15 years 1 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke