Sciweavers

860 search results - page 35 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
13 years 12 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Arithmetic circuits: the chasm at depth four gets wider
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
Pascal Koiran
VVS
1996
IEEE
129views Visualization» more  VVS 1996»
13 years 12 months ago
Optimal Isosurface Extraction from Irregular Volume Data
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
Paolo Cignoni, Claudio Montani, Enrico Puppo, Robe...
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
14 years 19 days ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
INFOCOM
2002
IEEE
14 years 18 days ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder