Sciweavers

584 search results - page 79 / 117
» Perspectives on Transactional Memory
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
14 years 11 months ago
Approximate Frequency Counts over Data Streams
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
Gurmeet Singh Manku, Rajeev Motwani
PODC
2011
ACM
14 years 2 months ago
A nonblocking set optimized for querying the minimum value
We present the Mindicator, a set implementation customized for shared memory runtime systems. The Mindicator is optimized for constant-time querying of its minimum element, while ...
Yujie Liu, Michael F. Spear
SBACPAD
2007
IEEE
143views Hardware» more  SBACPAD 2007»
15 years 6 months ago
A Code Compression Method to Cope with Security Hardware Overheads
Code Compression has been used to alleviate the memory requirements as well as to improve performance and/or minimize energy consumption. On the other hand, implementing security ...
Eduardo Wanderley Netto, Romain Vaslin, Guy Gognia...
SIMPRA
2011
14 years 6 months ago
A real-time multigrid finite hexahedra method for elasticity simulation using CUDA
In this paper we present a GPU-based multigrid approach for simulating elastic deformable objects in real time. Our method is based on a finite element discretization of the defo...
Christian Dick, Joachim Georgii, Rüdiger West...
84
Voted
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
15 years 4 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma