1538 search results - page 230 / 308 » Spectral Techniques in Graph Algorithms |
101
click to vote
UAI
2008
15 years 2 months ago
2008
Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform upd...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
110
click to vote
AC
2004
Springer
15 years 1 months ago
2004
Springer
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...
119
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
116
click to vote
KDD
2001
ACM
16 years 1 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...