1480 search results - page 210 / 296 » Distributed algorithms for weighted problems in sparse graph... |
113
Voted
CSB
2004
IEEE
15 years 4 months ago
2004
IEEE
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
112
Voted
ICONIP
2008
15 years 2 months ago
2008
We present a system for regression using MLP neural networks with hyperbolic tangent functions in the input, hidden and output layer. The activation functions in the input and outp...
116
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
178
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
87
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...