130 search results - page 6 / 26 » Optimal Lower Bounds on Regular Expression Size Using Commun... |
128
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
135
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
146
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
159
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
106
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, Cramer-Rao lower bounds (CRLBs) for estimation of vital signal parameters, such as respiration and heart-beat rates, using ultra-wideband (UWB) pulses are derive...