301 search results - page 20 / 61 » On Finding Dense Subgraphs |
ECCC
2008
14 years 9 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
DAGM
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We present a system for detecting shadows in dynamic outdoor scenes. The technique is based on fusing background subtraction operations performed on both color and dispar...
100
click to vote
JMLR
2010
14 years 4 months ago
2010
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
ENDM
2010
14 years 7 months ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...