2531 search results - page 298 / 507 » Group testing in graphs |
208
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
182
click to vote
JUCS
2006
15 years 6 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
167
click to vote
PRL
2006
15 years 6 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...
198
click to vote
JCO
1998
15 years 6 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
209
click to vote
PR
2008
15 years 6 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...