47 search results - page 7 / 10 » Approximate Constrained Subgraph Matching |
102
Voted
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
131
Voted
TIFS
2008
14 years 11 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
ALGOSENSORS
2007
Springer
15 years 5 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
110
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
113
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...