Sciweavers

IPPS
1997
IEEE
13 years 8 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
13 years 8 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
SIGCSE
1998
ACM
107views Education» more  SIGCSE 1998»
13 years 8 months ago
Web-based animation of data structures using JAWAA
JAWAA is a simple command language for creating animations of data structures and displaying them with a Web browser. Commands are stored in a script file that is retrieved and r...
Willard C. Pierson, Susan H. Rodger
SP
1998
IEEE
13 years 8 months ago
Stack and Queue Integrity on Hostile Platforms
When computationally intensive tasks have to be carried out on trusted, but limited, platforms such as smart cards, it becomes necessary to compensate for the limited resources me...
Premkumar T. Devanbu, Stuart G. Stubblebine
VISUALIZATION
1999
IEEE
13 years 8 months ago
Time-Critical Multiresolution Scene Rendering
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
Enrico Gobbetti, Eric Bouvier
ESOP
1999
Springer
13 years 8 months ago
Types for Safe Locking
Abstract. A race condition is a situation where two threads manipulate a data structure simultaneously, without synchronization. Race conditions are common errors in multithreaded ...
Cormac Flanagan, Martín Abadi
COMPGEOM
1999
ACM
13 years 8 months ago
The Path of a Triangulation
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
Oswin Aichholzer
COMPGEOM
2000
ACM
13 years 9 months ago
Kinetic connectivity for unit disks
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
Leonidas J. Guibas, John Hershberger, Subhash Suri...
INFOCOM
2000
IEEE
13 years 9 months ago
Fast and Scalable Priority Queue Architecture for High-Speed Network Switches
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...
Ranjita Bhagwan, Bill Lin
FOCS
2000
IEEE
13 years 9 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini