Sciweavers

208 search results - page 28 / 42
» Optimal SINR-based Random Access
Sort
View
TJS
2008
95views more  TJS 2008»
13 years 7 months ago
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
Akshat Verma, Sandeep Sen
EMSOFT
2010
Springer
13 years 5 months ago
Reducing stack with intra-task threshold priorities in real-time systems
In the design of hard real-time systems, the feasibility of the task set is one of the primary concerns. However, in embedded systems with scarce resources, optimizing resource us...
Gang Yao, Giorgio C. Buttazzo
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
ACL
2012
11 years 10 months ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu
AAAI
2012
11 years 10 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan