5606 search results - page 26 / 1122 » Randomization Techniques for Graphs. |
148
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
136
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
137
click to vote
PAMI
2007
15 years 2 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
168
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
166
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...