Sciweavers

11213 search results - page 70 / 2243
» Low-contention data structures
Sort
View
CN
1998
58views more  CN 1998»
15 years 3 months ago
A solid modeling library for the World Wide Web
A library of functions for the creation, manipulation, and viewing of solid models was created for deployment on the World Wide Web. The core data structure was based on the halfe...
Stephen Chi-fai Chan, Vincent T. Y. Ng, Albert S. ...
169
Voted
PVLDB
2008
157views more  PVLDB 2008»
15 years 2 months ago
SEDA: a system for search, exploration, discovery, and analysis of XML Data
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information emb...
Andrey Balmin, Latha S. Colby, Emiran Curtmola, Qu...
114
Voted
ISAAC
2007
Springer
108views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Checking Value-Sensitive Data Structures in Sublinear Space
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
Michael T. Goodrich, Jonathan Z. Sun
164
Voted
WSS
2001
133views Control Systems» more  WSS 2001»
15 years 5 months ago
A Composite Stabilizing Data Structure
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
Ted Herman, Imran A. Pirwani
IISWC
2008
IEEE
15 years 10 months ago
STAMP: Stanford Transactional Applications for Multi-Processing
Abstract—Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature,...
Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, ...