463 search results - page 48 / 93 » A General Framework for Graph Sparsification |
108
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
118
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
125
Voted
GG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
160
click to vote
CVPR
2001
IEEE
16 years 5 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...
118
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....