1461 search results - page 130 / 293 » Complexity of Graph Covering Problems |
117
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
150
Voted
DAM
2011
14 years 9 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
106
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
132
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
FLAIRS
2003
15 years 3 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...