87 search results - page 2 / 18 » Bounds for the generalized repetition threshold |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
MFCS
2010
Springer
14 years 7 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
68
Voted
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...
76
Voted
IPL
2007
14 years 9 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...