Sciweavers

363 search results - page 26 / 73
» Partial Multicuts in Trees
Sort
View
CAD
1998
Springer
14 years 11 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
COLING
2010
14 years 6 months ago
Dependency-Based Bracketing Transduction Grammar for Statistical Machine Translation
In this paper, we propose a novel dependency-based bracketing transduction grammar for statistical machine translation, which converts a source sentence into a target dependency t...
Jinsong Su, Yang Liu, Haitao Mi, Hongmei Zhao, Yaj...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 6 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
TOMS
2010
106views more  TOMS 2010»
14 years 10 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa