Sciweavers

13151 search results - page 2508 / 2631
» Position based dynamics
Sort
View
248
Voted
POPL
2009
ACM
16 years 3 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
117
Voted
PPOPP
2009
ACM
16 years 3 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
156
Voted
PODC
2009
ACM
16 years 3 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
135
Voted
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 3 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 3 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
« Prev « First page 2508 / 2631 Last » Next »