2004 search results - page 22 / 401 » Sampling from large graphs |
138
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
100
click to vote
BICOB
2009
Springer
15 years 6 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
159
click to vote
JPDC
2007
14 years 11 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
TSMC
2002
14 years 11 months ago
2002
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Shadow Hybrid Monte Carlo (SHMC) is a new method for sampling the phase space of large biological molecules. It improves sampling by allowing larger time steps and system sizes in ...