676 search results - page 46 / 136 » A Search-Free Intersection Algorithm |
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
133
click to vote
ACL
2004
15 years 1 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...
98
Voted
COMGEO
2007
ACM
15 years 14 days ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
79
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
99
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...