2004 search results - page 195 / 401 » Sampling from large graphs |
151
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Recent progresses in genotyping technologies allow the generation high-density genetic maps using hundreds of thousands of genetic markers for each DNA sample. The ava...
145
Voted
IANDC
2008
15 years 3 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
109
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
142
click to vote
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
134
Voted
ICPP
1991
IEEE
15 years 7 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...