1461 search results - page 129 / 293 » Complexity of Graph Covering Problems |
136
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
137
Voted
EKNOW
2009
15 years 9 days ago
2009
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...
138
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
121
click to vote
IJCAI
2003
15 years 3 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
157
click to vote
PPDP
2010
Springer
15 years 27 days ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...