1487 search results - page 172 / 298 » The Computational Complexity of Link Building |
179
click to vote
BIOINFORMATICS
2008
15 years 4 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
154
click to vote
DC
2008
15 years 4 months ago
2008
We study the feasibility and cost of implementing --a fundamental failure detector at the core of many algorithms--in systems with weak reliability and synchrony assumptions. Intui...
139
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
138
click to vote
GRID
2004
Springer
15 years 10 months ago
2004
Springer
e-Science has much to benefit from the emerging field of grid computing. However, construction of e-Science grids is a complex and inefficient undertaking. In particular, deployme...
150
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...