568 search results - page 11 / 114 » New bounds for the Cebysev functional |
CGA
2005
13 years 7 months ago
2005
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
ISVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
CN
2007
13 years 7 months ago
2007
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...
COCO
2003
Springer
14 years 22 days ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...