Sciweavers

2834 search results - page 567 / 567
» Representing Trees with Constraints
Sort
View
PLDI
2011
ACM
14 years 12 days 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...
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
12 years 12 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...
AAAI
2012
12 years 12 months ago
Transfer Learning in Collaborative Filtering with Uncertain Ratings
To solve the sparsity problem in collaborative filtering, researchers have introduced transfer learning as a viable approach to make use of auxiliary data. Most previous transfer...
Weike Pan, Evan Wei Xiang, Qiang Yang
TAP
2008
Springer
102views Hardware» more  TAP 2008»
14 years 9 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell