370 search results - page 64 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
COLING
2010
14 years 6 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
126
click to vote
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Efficient segmentation of globally optimal surfaces in volumetric images is a central problem in many medical image analysis applications. Intra-class variance has been successful...
90
Voted
DM
2002
14 years 11 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
93
Voted
SIAMCOMP
2000
14 years 11 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...