394 search results - page 49 / 79 » Testing subgraphs in large graphs |
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
JUCS
2007
13 years 7 months ago
2007
Abstract: Ranking is a ubiquitous requirement whenever we confront a large collection of atomic or interrelated artifacts. This paper elaborates on this issue for the case of RDF s...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
PRL
2006
13 years 7 months ago
2006
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is...
SSIRI
2010
13 years 6 months ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...