Sciweavers

8413 search results - page 51 / 1683
» Ordering Problem Subgoals
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICIP
2003
IEEE
14 years 9 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...
AAAI
1996
13 years 9 months ago
Design and Implementation of a Replay Framework Based on a Partial Order Planner
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
Laurie H. Ihrig, Subbarao Kambhampati
FORTE
2009
13 years 5 months ago
Using First-Order Logic to Reason about Submodule Construction
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the beha...
Gregor von Bochmann
DM
2002
92views more  DM 2002»
13 years 7 months ago
A local-global principle for vertex-isoperimetric problems
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
Sergei L. Bezrukov, Oriol Serra