Sciweavers

546 search results - page 85 / 110
» An operational happens-before memory model
Sort
View
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 11 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
SMA
2008
ACM
131views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Streaming tetrahedral mesh optimization
Improving the quality of tetrahedral meshes is an important operation in many scientific computing applications. Meshes with badly shaped elements impact both the accuracy and con...
Tian Xia, Eric Shaffer
TC
2008
14 years 9 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
ISCA
2007
IEEE
94views Hardware» more  ISCA 2007»
14 years 9 months ago
Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
Eric Chi, Stephen A. Lyon, Margaret Martonosi