Sciweavers

2403 search results - page 107 / 481
» Optimal Randomized RANSAC
Sort
View
123
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...
EDM
2009
116views Data Mining» more  EDM 2009»
15 years 1 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 3 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 3 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 3 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin