Sciweavers

320 search results - page 47 / 64
» Algebraic Signatures for Scalable Distributed Data Structure...
Sort
View
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
86
Voted
IPPS
2010
IEEE
14 years 9 months ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 12 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
BMCBI
2010
111views more  BMCBI 2010»
14 years 12 months ago
Functional Analysis: Evaluation of Response Intensities - Tailoring ANOVA for Lists of Expression Subsets
Background: Microarray data is frequently used to characterize the expression profile of a whole genome and to compare the characteristics of that genome under several conditions....
Fabrice Berger, Bertrand De Meulder, Anthoula Gaig...
HPCA
2000
IEEE
15 years 4 months ago
Design of a Parallel Vector Access Unit for SDRAM Memory Systems
We are attacking the memory bottleneck by building a “smart” memory controller that improves effective memory bandwidth, bus utilization, and cache efficiency by letting appl...
Binu K. Mathew, Sally A. McKee, John B. Carter, Al...