5105 search results - page 95 / 1021 » Approximate Structural Consistency |
117
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
107
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
120
click to vote
EMMCVPR
2005
Springer
2005
Springer
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
15 years 9 months ago
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
104
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
117
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...