Sciweavers

3131 search results - page 426 / 627
» Generalized connection caching
Sort
View
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
16 years 29 days ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
158
Voted
AOSD
2009
ACM
16 years 28 days ago
Enforcing security for desktop clients using authority aspects
Desktop client applications interact with both local and remote resources. This is both a benefit in terms of the rich features desktop clients can provide, but also a security r...
Brett Cannon, Eric Wohlstadter
144
Voted
PLDI
2009
ACM
16 years 28 days ago
Programming model for a heterogeneous x86 platform
The client computing platform is moving towards a heterogeneous architecture consisting of a combination of cores focused on scalar performance, and a set of throughput-oriented c...
Bratin Saha, Xiaocheng Zhou, Hu Chen, Ying Gao, Sh...
158
Voted
PLDI
2009
ACM
16 years 28 days ago
GC assertions: using the garbage collector to check heap properties
This paper introduces GC assertions, a system interface that programmers can use to check for errors, such as data structure invariant violations, and to diagnose performance prob...
Edward Aftandilian, Samuel Z. Guyer
195
Voted
SAC
2009
ACM
16 years 28 days ago
NECTAR: a DTN routing protocol based on neighborhood contact history
There are a number of scenarios where connectivity is intermittent, and a given destination may not be reachable at the moment a message is sent. Networks with these characteristi...
Etienne C. R. de Oliveira, Célio V. N. de A...