Sciweavers

3865 search results - page 252 / 773
» Active memory operations
Sort
View
CCCG
2010
15 years 8 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh
APDC
1994
15 years 8 months ago
WEA, a Distributed Object Manager Based on a Workspace Hierarchy
WEA is our implementation of a new architectural model for virtual memory access, the WorkSpace. It relies on a generalisation of client / server model and enables to build new di...
Didier Donsez, Philippe Homond, Pascal Faudemay
160
Voted
NA
2010
87views more  NA 2010»
15 years 5 months ago
A note on the O(n)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm...
Federico Poloni
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 8 months ago
Efficient Processing of XML Update Streams
This paper introduces a framework for processing continuous, exact queries over continuous update XML streams. Instead of eagerly performing the updates on cached portions of the s...
Leonidas Fegaras
SOSP
1997
ACM
15 years 8 months ago
Automated Hoarding for Mobile Computers
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
Geoffrey H. Kuenning, Gerald J. Popek