Sciweavers

934 search results - page 157 / 187
» context 2003
Sort
View
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
13 years 11 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
13 years 11 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
UAI
2003
13 years 11 months ago
The Revisiting Problem in Mobile Robot Map Building: A Hierarchical Bayesian Approach
We present an application of hierarchical Bayesian estimation to robot map building. The revisiting problem occurs when a robot has to decide whether it is seeing a previously-bui...
Benjamin Stewart, Jonathan Ko, Dieter Fox, Kurt Ko...
UAI
2003
13 years 11 months ago
Renewal Strings for Cleaning Astronomical Databases
Large astronomical databases obtained from sky surveys such as the SuperCOSMOS Sky Surveys (SSS) invariably suffer from spurious records coming from artefactual effects of the t...
Amos J. Storkey, Nigel C. Hambly, Christopher K. I...
UAI
2003
13 years 11 months ago
Strong Faithfulness and Uniform Consistency in Causal Inference
A fundamental question in causal inference is whether it is possible to reliably infer the manipulation effects from observational data. There are a variety of senses of asymptot...
Jiji Zhang, Peter Spirtes