1282 search results - page 27 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
JCDL
2006
ACM
14 years 1 months ago
2006
ACM
A number of projects are creating searchable digital libraries of printed books. These include the Million Book Project, the Google Book project and similar efforts from Yahoo an...
ARC
2007
Springer
13 years 11 months ago
2007
Springer
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
AAAI
2000
13 years 9 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...