941 search results - page 48 / 189 » Efficient Testing of Large Graphs |
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
VTS
2003
IEEE
15 years 3 months ago
2003
IEEE
—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...
105
click to vote
SSD
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
107
click to vote
IOR
2011
14 years 4 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
ETS
2007
IEEE
15 years 4 months ago
2007
IEEE
An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. Therefore embedded memories are commonly equipped with spare r...