Sciweavers

10054 search results - page 1951 / 2011
» On the Complexity of Function Learning
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGMOD
2010
ACM
211views Database» more  SIGMOD 2010»
14 years 2 months ago
ERACER: a database approach for statistical inference and data cleaning
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
Chris Mayfield, Jennifer Neville, Sunil Prabhakar
EUROCRYPT
2010
Springer
14 years 2 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 2 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
CCA
2009
Springer
14 years 2 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
« Prev « First page 1951 / 2011 Last » Next »