4428 search results - page 21 / 886 » The Chow Parameters Problem |
ALGORITHMICA
2010
14 years 12 months ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
ICIP
2004
IEEE
16 years 1 months ago
2004
IEEE
We provide a new technique for the Euclidean upgrading of a projective calibration for a set of ten or more cameras with known skew angle and aspect ratio and arbitrary varying fo...
92
Voted
INFOCOM
1998
IEEE
15 years 4 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
111
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
UAI
2004
15 years 1 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...