2796 search results - page 373 / 560 » The coolest path problem |
157
click to vote
CCCG
2007
15 years 8 months ago
2007
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
164
click to vote
CCCG
2007
15 years 8 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
158
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
187
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...