Sciweavers

1169 search results - page 146 / 234
» Degrees of monotone complexity
Sort
View
90
Voted
FUIN
2008
119views more  FUIN 2008»
15 years 24 days ago
Modeling Communication with Synchronized Environments
A deterministic behavior of systems composed of several modules is a desirable design goal. Assembling a complex system from components requires also a high degree of re-usability....
Tiberiu Seceleanu, Axel Jantsch
109
Voted
BMCBI
2005
97views more  BMCBI 2005»
15 years 19 days ago
The yeast kinome displays scale free topology with functional hub clusters
Background: The availability of interaction databases provides an opportunity for researchers to utilize immense amounts of data exclusively in silico. Recently there has been an ...
Robin E. C. Lee, Lynn A. Megeney
TPDS
2008
113views more  TPDS 2008»
15 years 19 days ago
Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
Abdallah Al Zain, Philip W. Trinder, Greg Michaels...
SIAMCOMP
2011
14 years 7 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
160
Voted
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
13 years 8 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang