Sciweavers

59 search results - page 1 / 12
» On the structure of a random sum-free set of positive intege...
Sort
View
DM
1998
54views more  DM 1998»
13 years 4 months ago
On the structure of a random sum-free set of positive integers
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
Neil J. Calkin
CPC
2010
144views more  CPC 2010»
13 years 2 months ago
What Does a Random Contingency Table Look Like?
Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . . + rm = c1 + . . . + cn. We consider the set (R, C) of non-negative m
Alexander I. Barvinok
RSA
2006
81views more  RSA 2006»
13 years 4 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan
ICCV
2009
IEEE
13 years 2 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
EJC
2007
13 years 4 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...