Sciweavers

2940 search results - page 550 / 588
» Behavioral Constraints for Services
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Language-independent sandboxing of just-in-time compilation and self-modifying code
When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such ...
Jason Ansel, Petr Marchenko, Úlfar Erlingss...
SIGCOMM
2012
ACM
11 years 10 months ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
11 years 10 months ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 10 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
WWW
2009
ACM
14 years 8 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel