5329 search results - page 153 / 1066 » The Weighted Majority Algorithm |
110
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
159
Voted
ACL
2004
15 years 3 months ago
2004
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
129
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
106
Voted
MST
2010
15 years 28 days ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
127
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper, we demonstrate an integrated registration and clustering algorithm to compute an atlas of fiberbundles from a set of multi-subject diffusion weighted MR images. We ...