Sciweavers

941 search results - page 22 / 189
» Efficient Testing of Large Graphs
Sort
View
DFT
2004
IEEE
94views VLSI» more  DFT 2004»
15 years 1 months ago
Response Compaction for Test Time and Test Pins Reduction Based on Advanced Convolutional Codes
This paper addresses the problem of test response compaction. In order to maximize compaction ratio, a single-output encoder based on check matrix of a (n, n1, m, 3) convolutional...
Yinhe Han, Yu Hu, Huawei Li, Xiaowei Li, Anshuman ...
77
Voted
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 3 months ago
Efficient octilinear Steiner tree construction based on spanning graphs
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Y...
FUIN
2006
139views more  FUIN 2006»
14 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
SIGSOFT
2005
ACM
15 years 10 months ago
CUTE: a concolic unit testing engine for C
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
Koushik Sen, Darko Marinov, Gul Agha
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
15 years 7 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...