Sciweavers

2004 search results - page 71 / 401
» Sampling from large graphs
Sort
View
ICML
2005
IEEE
16 years 19 days ago
Intrinsic dimensionality estimation of submanifolds in Rd
We present a new method to estimate the intrinsic dimensionality of a submanifold M in Rd from random samples. The method is based on the convergence rates of a certain U-statisti...
Matthias Hein, Jean-Yves Audibert
ATAL
2007
Springer
15 years 6 months ago
Approximate state estimation in multiagent settings with continuous or large discrete state spaces
We present a new method for carrying out state estimation in multiagent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagen...
Prashant Doshi
BMCBI
2006
108views more  BMCBI 2006»
14 years 12 months ago
FastGroupII: A web-based bioinformatics platform for analyses of large 16S rDNA libraries
Background: High-throughput sequencing makes it possible to rapidly obtain thousands of 16S rDNA sequences from environmental samples. Bioinformatic tools for the analyses of larg...
Yanan Yu, Mya Breitbart, Pat McNairnie, Forest Roh...
CORR
2010
Springer
145views Education» more  CORR 2010»
14 years 12 months ago
Feature Level Clustering of Large Biometric Database
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...
Hunny Mehrotra, Dakshina Ranjan Kisku, V. Bhawani ...
ICPR
2002
IEEE
15 years 4 months ago
A Large Scale Clustering Scheme for Kernel K-Means
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
Rong Zhang, Alexander I. Rudnicky