200 search results - page 32 / 40 » Fast Computation of Reachability Labeling for Large Graphs |
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
ICOIN
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
ICNP
2007
IEEE
14 years 4 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
CIDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...