1127 search results - page 164 / 226 » Testing the Expansion of a Graph |
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
ICSM
2007
IEEE
15 years 4 months ago
2007
IEEE
The build system forms an indispensable part of any software project. It needs to evolve in parallel with the source code in order to build, test and install the software. Unfortu...
ISBI
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper introduces a new method based on k-Nearest Neighbors Graphs (KNNG) for bringing into alignment multiple views of the same scene acquired at two different time points. T...
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...