Sciweavers

2996 search results - page 54 / 600
» Numberings and Randomness
Sort
View
NIPS
2007
13 years 11 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
RSA
2006
78views more  RSA 2006»
13 years 9 months ago
Nodes of large degree in random trees and forests
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...
Bernhard Gittenberger
ALENEX
2004
120views Algorithms» more  ALENEX 2004»
13 years 11 months ago
Compositions and Patricia Tries: No Fluctuations in the Variance!
We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...
Helmut Prodinger
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 9 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
FSTTCS
1999
Springer
14 years 2 months ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy