672 search results - page 43 / 135 » A General Solution to the Graph History Interaction Problem |
SAC
2003
ACM
14 years 26 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
IJCAI
1989
13 years 8 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
FIW
2009
13 years 5 months ago
2009
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
HM
2007
Springer
14 years 1 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...