Sciweavers

198 search results - page 33 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
DKE
2010
167views more  DKE 2010»
13 years 5 months ago
Discovering private trajectories using background information
Trajectories are spatio-temporal traces of moving objects which contain valuable information to be harvested by spatio-temporal data mining techniques. Applications like city traf...
Emre Kaplan, Thomas Brochmann Pedersen, Erkay Sava...
DAC
2008
ACM
14 years 8 months ago
Parameterized timing analysis with general delay models and arbitrary variation sources
Many recent techniques for timing analysis under variability, in which delay is an explicit function of underlying parameters, may be described as parameterized timing analysis. T...
Khaled R. Heloue, Farid N. Najm
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 8 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...