Sciweavers

1806 search results - page 120 / 362
» Randomness and halting probabilities
Sort
View
JCT
2011
90views more  JCT 2011»
13 years 5 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
TMC
2011
131views more  TMC 2011»
13 years 5 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
SIGKDD
2010
128views more  SIGKDD 2010»
13 years 4 months ago
On cross-validation and stacking: building seemingly predictive models on random data
A number of times when using cross-validation (CV) while trying to do classification/probability estimation we have observed surprisingly low AUC's on real data with very few...
Claudia Perlich, Grzegorz Swirszcz
IROS
2008
IEEE
108views Robotics» more  IROS 2008»
14 years 4 months ago
A random set formulation for Bayesian SLAM
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
John Mullane, Ba-Ngu Vo, Martin David Adams, Wijer...
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