663 search results - page 27 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
To recognize three-dimensional objects it is important to
model how their appearances can change due to changes
in viewpoint. A key aspect of this involves understanding
which o...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
In the context of variational image segmentation, we propose a new finite-dimensional implicit surface representation. The key idea is to span a subset of implicit functions with ...
DAC
1989
ACM
13 years 12 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
TCS
1998
13 years 7 months ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...