2004 search results - page 284 / 401 » Sampling from large graphs |
116
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
134
click to vote
SMI
2010
IEEE
15 years 26 days ago
2010
IEEE
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
153
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
130
Voted
SMA
2008
ACM
15 years 2 months ago
2008
ACM
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
The paper presents results of the face verification contest that was organized in conjunction with International Conference on Pattern Recognition 2000 [14]. Participants had to u...