518 search results - page 56 / 104 » Beating a Random Assignment |
118
Voted
ECCV
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
156
click to vote
PARA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
105
Voted
ACSAC
2003
IEEE
15 years 7 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
105
click to vote
AVBPA
2003
Springer
15 years 7 months ago
2003
Springer
This paper describes a novel framework for the Open World face recognition problem, where one has to provide for the Reject option. Based upon algorithmic randomness and transducti...
107
click to vote
PAKDD
2010
ACM
15 years 7 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...