Sciweavers

1941 search results - page 323 / 389
» On the Hardness of Approximate Reasoning
Sort
View
IHI
2010
197views Healthcare» more  IHI 2010»
14 years 6 months ago
Beyond safe harbor: automatic discovery of health information de-identification policy alternatives
Regulations in various countries permit the reuse of health information without patient authorization provided the data is "de-identified". In the United States, for ins...
Kathleen Benitez, Grigorios Loukides, Bradley Mali...
ISCA
2011
IEEE
294views Hardware» more  ISCA 2011»
14 years 3 months ago
Moguls: a model to explore the memory hierarchy for bandwidth improvements
In recent years, the increasing number of processor cores and limited increases in main memory bandwidth have led to the problem of the bandwidth wall, where memory bandwidth is b...
Guangyu Sun, Christopher J. Hughes, Changkyu Kim, ...
POPL
2011
ACM
14 years 2 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown