Sciweavers

1816 search results - page 141 / 364
» Trace oblivious computation
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
DKE
2007
130views more  DKE 2007»
13 years 10 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan
ALGORITHMICA
1999
156views more  ALGORITHMICA 1999»
13 years 10 months ago
Competitive Optimal On-Line Leasing
Consider an on-line player who needs some equipment (e.g., a computer) for an initially unknown number of periods. At the start of each period it is determined whether the player w...
Ran El-Yaniv, R. Kaniel, Nathan Linial
WWW
2006
ACM
14 years 11 months ago
Analysis of WWW traffic in Cambodia and Ghana
In this paper we present an analysis of HTTP traffic captured from Internet caf?es and kiosks from two different developing countries ? Cambodia and Ghana. This paper has two main...
Bowei Du, Michael J. Demmer, Eric A. Brewer
TOG
2008
123views more  TOG 2008»
13 years 10 months ago
Efficient multiple scattering in hair using spherical harmonics
Previous research has shown that a global multiple scattering simulation is needed to achieve physically realistic renderings of hair, particularly light-colored hair with low abs...
Jonathan T. Moon, Bruce Walter, Steve Marschner