217 search results - page 20 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
UAI
1997
14 years 11 months ago
1997
This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [1...
MOR
2008
14 years 9 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
ISBI
2006
IEEE
15 years 10 months ago
2006
IEEE
We have developed two algorithms for source imaging from MEG/EEG data. Contribution to sensor data from a source at a particular voxel is expressed as the product of a known lead ...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...