Sciweavers

7840 search results - page 172 / 1568
» On generalized Ramsey numbers
Sort
View
INFOVIS
2000
IEEE
15 years 5 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
93
Voted
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
15 years 5 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
RTSS
1994
IEEE
15 years 4 months ago
On-Line Scheduling to Maximize Task Completions
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma
123
Voted
AAECC
1993
Springer
170views Algorithms» more  AAECC 1993»
15 years 4 months ago
Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
Gilles Lachaud
122
Voted
COCOON
2006
Springer
15 years 4 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...