Sciweavers

535 search results - page 78 / 107
» Predicting Application Run Times Using Historical Informatio...
Sort
View
IACR
2011
94views more  IACR 2011»
14 years 1 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,...
HPDC
1998
IEEE
15 years 6 months ago
Metascheduling: A Scheduling Model for Metacomputing Systems
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
Jon B. Weissman
SIGKDD
2010
259views more  SIGKDD 2010»
14 years 8 months ago
Activity recognition using cell phone accelerometers
Mobile devices are becoming increasingly sophisticated and the latest generation of smart cell phones now incorporates many diverse and powerful sensors. These sensors include GPS...
Jennifer R. Kwapisz, Gary M. Weiss, Samuel Moore
CIT
2006
Springer
15 years 5 months ago
A Contention Window Based Differentiation Mechanism for providing QoS in Wireless LANs
Running real time applications over wireless LANs is becoming common place. These applications require QoS. But the most widely used wireless LAN, IEEE 802.11, does not have QoS s...
Mayank Mishra, Anirudha Sahoo
SIGIR
2008
ACM
15 years 1 months ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum