1282 search results - page 38 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
ISBRA
2010
Springer
14 years 2 months ago
2010
Springer
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
PKDD
2007
Springer
14 years 1 months ago
2007
Springer
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...