5592 search results - page 806 / 1119 » On Random Betweenness Constraints |
180
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Fixing concurrency bugs (or crugs) is critical in modern software systems. Static analyses to find crugs such as data races and atomicity violations scale poorly, while dynamic a...
162
click to vote
PSD
2010
Springer
15 years 5 months ago
2010
Springer
The pre-tabular statistical disclosure control (SDC) method of data swapping is the preferred method for protecting Census tabular data in some National Statistical Institutes, in...
200
click to vote
PVLDB
2010
15 years 5 months ago
2010
High-end solid state disks (SSDs) provide much faster access to data compared to conventional hard disk drives. We present a technique for using solid-state storage as a caching l...
211
Voted
PVLDB
2010
15 years 5 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
176
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...