Sciweavers

9611 search results - page 97 / 1923
» A Note on Difference Sets
Sort
View
CADE
1999
Springer
14 years 1 months ago
System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
Matthias Baaz, Alexander Leitsch, Georg Moser
NAACL
2007
13 years 10 months ago
Implicitly Supervised Language Model Adaptation for Meeting Transcription
We describe the use of meeting metadata, acquired using a computerized meeting organization and note-taking system, to improve automatic transcription of meetings. By applying a t...
David Huggins-Daines, Alexander I. Rudnicky
ANOR
2007
80views more  ANOR 2007»
13 years 9 months ago
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
John J. H. Forrest, John A. Tomlin
COMGEO
2006
ACM
13 years 9 months ago
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
Christopher Dyken, Michael S. Floater
DM
2006
71views more  DM 2006»
13 years 9 months ago
Pair lengths of product graphs
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
Demetres Christofides