Sciweavers

3428 search results - page 682 / 686
» Making the Case
Sort
View
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
11 years 11 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
CVPR
2012
IEEE
11 years 11 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
ISCA
2012
IEEE
212views Hardware» more  ISCA 2012»
11 years 11 months ago
TimeWarp: Rethinking timekeeping and performance monitoring mechanisms to mitigate side-channel attacks
Over the past two decades, several microarchitectural side channels have been exploited to create sophisticated security attacks. Solutions to this problem have mainly focused on ...
Robert Martin, John Demme, Simha Sethumadhavan
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
Characterizing continuous time random walks on time varying graphs
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...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich