603 search results - page 77 / 121 » A General Approximation Technique for Constrained Forest Pro... |
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
IPL
2008
14 years 12 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
PASTE
2004
ACM
15 years 5 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
194
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...