Sciweavers

1127 search results - page 70 / 226
» Testing the Expansion of a Graph
Sort
View
IBIS
2006
109views more  IBIS 2006»
14 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
ISBI
2006
IEEE
15 years 10 months ago
Mapping ventricular changes related to dementia and mild cognitive impairment in a large community-based cohort
We present a fully-automated technique for visualizing localized cerebral ventricle shape differences between large clinical subject groups who have received a magnetic resonance ...
Owen T. Carmichael, Paul M. Thompson, Rebecca A. D...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 3 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
COMPSAC
2003
IEEE
15 years 3 months ago
Data-Flow-Based Unit Testing of Aspect-Oriented Programs
The current research so far in aspect-oriented software development is focused on problem analysis, software design, and implementation techniques. Even though the importance of s...
Jianjun Zhao
VTS
2003
IEEE
119views Hardware» more  VTS 2003»
15 years 3 months ago
Test Data Compression Using Dictionaries with Fixed-Length Indices
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
Lei Li, Krishnendu Chakrabarty