Sciweavers

2208 search results - page 318 / 442
» Memory Practices in the Sciences
Sort
View
ICALP
2011
Springer
14 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
ICCV
2011
IEEE
13 years 10 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
ATVA
2011
Springer
254views Hardware» more  ATVA 2011»
13 years 10 months ago
Formal Analysis of Online Algorithms
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
Benjamin Aminof, Orna Kupferman, Robby Lampert
IACR
2011
127views more  IACR 2011»
13 years 9 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...
CC
2012
Springer
227views System Software» more  CC 2012»
13 years 5 months ago
Programming Paradigm Driven Heap Analysis
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
Mark Marron, Ondrej Lhoták, Anindya Banerje...