135 search results - page 14 / 27 » Hardness of cut problems in directed graphs |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
104
click to vote
PAMI
2010
14 years 8 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...