Sciweavers

2056 search results - page 128 / 412
» time 2000
Sort
View
145
Voted
COCO
2000
Springer
123views Algorithms» more  COCO 2000»
15 years 9 months ago
A Lower Bound for the Shortest Path Problem
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
Ketan Mulmuley, Pradyut Shah
CGI
2000
IEEE
15 years 8 months ago
Molecular Dynamics Visualization with XML and VRML
A new Extensible Markup Language (XML) application, Molecular Dynamics Language (MoDL) has been developed. MoDL provides a simple, but powerful tool for molecular dynamics visuali...
B. Arun, V. Chandru, A. D. Ganguly, Swami Manohar
143
Voted
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
15 years 8 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
138
Voted
ESOP
2000
Springer
15 years 8 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
EUROPAR
2000
Springer
15 years 8 months ago
Scheduling Queries for Tape-Resident Data
Tertiary storage systems are used when secondary storage can not satisfy the data storage requirements and/or it is a more cost effective option. The new application domains requir...
Sachin More, Alok N. Choudhary