Sciweavers

1369 search results - page 62 / 274
» Lattice computations for random numbers
Sort
View
DCG
2008
104views more  DCG 2008»
13 years 9 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
ICML
2007
IEEE
14 years 9 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
LPNMR
2009
Springer
14 years 3 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
CPC
2006
93views more  CPC 2006»
13 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 10 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...