Sciweavers

7259 search results - page 111 / 1452
» From Fields to Trees
Sort
View
ACL
2008
13 years 9 months ago
Generalized Expectation Criteria for Semi-Supervised Learning of Conditional Random Fields
This paper presents a semi-supervised training method for linear-chain conditional random fields that makes use of labeled features rather than labeled instances. This is accompli...
Gideon S. Mann, Andrew McCallum
ACL
2004
13 years 9 months ago
Discriminative Language Modeling with Conditional Random Fields and the Perceptron Algorithm
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins, Mark...
MICCAI
2005
Springer
14 years 9 months ago
Automatic Vascular Tree Formation Using the Mahalanobis Distance
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
Julien Jomier, Vincent LeDigarcher, Stephen R. Ayl...
RECOMB
2001
Springer
14 years 8 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 9 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann