457 search results - page 79 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
JCP
2007
13 years 7 months ago
2007
— In this paper the development of mathematical model of voltage-input and current-input active magnetic bearing (AMB) system in deterministic form is presented. The AMB system, ...
TSP
2008
13 years 7 months ago
2008
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
CPC
1998
13 years 7 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...