Sciweavers

24188 search results - page 4752 / 4838
» Computing on Encrypted Data
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 7 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
COBUILD
1998
Springer
15 years 7 months ago
An Agent-Based Telecooperation Framework
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
Albrecht Schmidt, Alexander Specker, Gerhard Parts...
ASPLOS
2009
ACM
15 years 7 months ago
Accelerating phase unwrapping and affine transformations for optical quadrature microscopy using CUDA
Optical Quadrature Microscopy (OQM) is a process which uses phase data to capture information about the sample being studied. OQM is part of an imaging framework developed by the ...
Perhaad Mistry, Sherman Braganza, David R. Kaeli, ...
IPCAI
2010
15 years 7 months ago
Evaluation of a 4D Cone-Beam CT Reconstruction Approach Using an Anthropomorphic Phantom
Abstract. We have previously developed image-guided navigation systems for thoracic abdominal interventions utilizing a three dimensional (3D) Cone-Beam CT (CBCT) image acquired at...
Ziv Yaniv, Jan Boese, Marily Sarmiento, Kevin Clea...
COMPGEOM
2007
ACM
15 years 7 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
« Prev « First page 4752 / 4838 Last » Next »