2370 search results - page 224 / 474 » A Structured Set of Higher-Order Problems |
145
click to vote
JCT
2011
14 years 11 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
155
Voted
BMCBI
2006
15 years 4 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
154
Voted
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
129
click to vote
AAAI
2012
13 years 6 months ago
2012
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
115
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
In this paper, we consider the problem of recovering the
spatial layout of indoor scenes from monocular images. The
presence of clutter is a major problem for existing singleview...