Sciweavers

1763 search results - page 71 / 353
» Dependent random choice
Sort
View
ICALP
2004
Springer
14 years 2 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
ICPR
2010
IEEE
13 years 11 months ago
Compressing Sparse Feature Vectors Using Random Ortho-Projections
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...
Esa Rahtu, Mikko Salo, Janne Heikkilä
SIAMDM
2008
99views more  SIAMDM 2008»
13 years 9 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
RSA
2011
124views more  RSA 2011»
13 years 4 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
TSP
2012
12 years 4 months ago
Randomized Isometric Linear-Dispersion Space-Time Block Coding for the DF Relay Channel
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
David Gregoratti, Walid Hachem, Xavier Mestre