248 search results - page 31 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
105
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
147
click to vote
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
167
click to vote
ISPAN
2002
IEEE
15 years 8 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
114
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
131
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...