Sciweavers

7773 search results - page 127 / 1555
» On generalized Frame-Stewart numbers
Sort
View
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 3 months ago
The Optimality of a Fast CNF Conversion and its Use with SAT
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
Daniel Sheridan
COMPGEOM
2010
ACM
15 years 3 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
INFOVIS
2000
IEEE
15 years 2 months ago
Using Visualization to Detect Plagiarism in Computer Science Classes
This paper introduces a number of general methods for visualizing commonality in sets of text files. Each visualization simultaneously compares one file in the set to all other ...
Randy L. Ribler, Marc Abrams
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
15 years 2 months ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani
ACL
2009
14 years 7 months ago
Correlating Human and Automatic Evaluation of a German Surface Realiser
We examine correlations between native speaker judgements on automatically generated German text against automatic evaluation metrics. We look at a number of metrics from the MT a...
Aoife Cahill