Sciweavers

2254 search results - page 108 / 451
» Computing the minimal covering set
Sort
View
89
Voted
JC
2011
87views more  JC 2011»
14 years 7 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
CDC
2008
IEEE
122views Control Systems» more  CDC 2008»
15 years 7 months ago
Metabolic networks analysis using convex optimization
— Metabolic networks map the biochemical reactions in a living cell to the flow of various chemical substances in the cell, which are called metabolites. A standard model of a m...
A. Agung Julius, Marcin Imielinski, George J. Papp...
DAC
1993
ACM
15 years 4 months ago
On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping
In this paper we study the area and depth trade-off in LUT based FPGA technology mapping. Starting from a depth-optimal mapping solution, we perform a number of depth relaxation o...
Jason Cong, Yuzheng Ding
122
Voted
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
15 years 6 months ago
Bist Reseeding with very few Seeds
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
109
Voted
ASWC
2008
Springer
15 years 2 months ago
A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
Finding the justifications for an entailment (i.e., minimal sets of axioms responsible for it) is a prominent reasoning service in ontology engineering, as justifications facilitat...
Boontawee Suntisrivaraporn, Guilin Qi, Qiu Ji, Pet...