Sciweavers

ASIAN
2000
Springer
156views Algorithms» more  ASIAN 2000»
14 years 4 months ago
Reusing Animations in Databases for Multimedia Presentations
Abstract. Multimedia presentations and their applications are becoming more and more popular in most spheres of industry and everyday life. A database approach could help in queryi...
Zhiyong Huang, Binjia Jiao, B. Prabhakaran, Conrad...
ASIACRYPT
2000
Springer
14 years 4 months ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
APPROX
2000
Springer
84views Algorithms» more  APPROX 2000»
14 years 4 months ago
On the relative complexity of approximate counting problems
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
14 years 4 months ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
14 years 4 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
14 years 4 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
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
14 years 4 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
14 years 4 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
ANTS
2000
Springer
94views Algorithms» more  ANTS 2000»
14 years 4 months ago
Computing All Integer Solutions of a General Elliptic Equation
Roel J. Stroeker, Nikolaus Tzanakis