1097 search results - page 162 / 220 » Testing Graph Isomorphism |
138
click to vote
JCO
1998
15 years 2 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...
133
click to vote
PR
2008
15 years 1 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...
119
click to vote
MICCAI
2010
Springer
15 years 25 days ago
2010
Springer
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
121
click to vote
OOPSLA
2010
Springer
15 years 25 days ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
117
click to vote
ACL
2010
15 years 14 days ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...