Sciweavers

2434 search results - page 67 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
JDA
2008
100views more  JDA 2008»
15 years 3 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
114
Voted
RSA
2008
80views more  RSA 2008»
15 years 2 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
90
Voted
ICPR
2008
IEEE
15 years 9 months ago
RANSAC-SVM for large-scale datasets
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...
Kenji Watanabe, Takio Kurita
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
15 years 10 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...
128
Voted
PAMI
2010
164views more  PAMI 2010»
15 years 1 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas