Sciweavers

2996 search results - page 195 / 600
» Numberings and Randomness
Sort
View
NIPS
2004
15 years 8 months ago
Self-Tuning Spectral Clustering
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
Lihi Zelnik-Manor, Pietro Perona
TCS
2008
15 years 6 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
ICCTA
2007
IEEE
15 years 10 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 7 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 6 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh