2834 search results - page 567 / 567 » Representing Trees with Constraints |
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
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 ...
SIGMETRICS
2012
ACM
11 years 7 months ago
2012
ACM
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...
AAAI
2012
11 years 7 months ago
2012
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...
TAP
2008
Springer
13 years 5 months ago
2008
Springer
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, ...