941 search results - page 50 / 189 » Efficient Testing of Large Graphs |
114
Voted
DAC
2007
ACM
16 years 4 months ago
2007
ACM
Many STUMPS architectures found in current chip designs allow disabling of individual scan chains for debug and diagnosis. In a recent paper it has been shown that this feature can...
119
Voted
GI
2007
Springer
15 years 7 months ago
2007
Springer
: Test-case generation with model-checkers is a promising field of research in software testing. Model-checker based approaches offer many advantages: They are fully automated, the...
106
Voted
GD
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
155
click to vote
JMLR
2010
14 years 10 months ago
2010
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
135
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...