Sciweavers

853 search results - page 131 / 171
» Are many small sets explicitly small
Sort
View
INFOCOM
2009
IEEE
14 years 5 months ago
Estimating Hop Distance Between Arbitrary Host Pairs
—Establishing a clear and timely picture of Internet topology is complicated by many factors including the vast size and dynamic nature of the infrastructure. In this paper, we d...
Brian Eriksson, Paul Barford, Robert D. Nowak
SIGIR
2006
ACM
14 years 5 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
14 years 10 days ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
14 years 9 days ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
BMCBI
2010
108views more  BMCBI 2010»
13 years 11 months ago
Error, reproducibility and sensitivity : a pipeline for data processing of Agilent oligonucleotide expression arrays
Background: Expression microarrays are increasingly used to obtain large scale transcriptomic information on a wide range of biological samples. Nevertheless, there is still much ...
Benjamin Chain, Helen Bowen, John Hammond, Wilfrie...