Sciweavers

2614 search results - page 437 / 523
» Customizable Data Distribution for Shared Data Spaces
Sort
View
98
Voted
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 7 months ago
Aging in language dynamics
Human languages evolve continuously, and a puzzling problem is how to reconcile the apparent robustness of most of the deep linguistic structures we use with the evidence that the...
Animesh Mukherjee, Francesca Tria, Andrea Baronche...
ICDCS
2007
IEEE
15 years 7 months ago
Automated Storage Reclamation Using Temporal Importance Annotations
This work focuses on scenarios that require the storage of large amounts of data. Such systems require the ability to either continuously increase the storage space or reclaim spa...
Surendar Chandra, Ashish Gehani, Xuwen Yu
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
15 years 10 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
IPSN
2007
Springer
15 years 6 months ago
Harbor: software-based memory protection for sensor nodes
Many sensor nodes contain resource constrained microcontrollers where user level applications, operating system components, and device drivers share a single address space with no...
Ram Kumar, Eddie Kohler, Mani B. Srivastava
130
Voted
CF
2010
ACM
15 years 4 months ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...