1487 search results - page 151 / 298 » The Computational Complexity of Link Building |
126
click to vote
COCOON
2010
Springer
15 years 9 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
137
Voted
CSC
2008
15 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
148
click to vote
GISCIENCE
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
133
Voted
PE
2002
Springer
15 years 4 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
163
Voted
AINA
2005
IEEE
15 years 10 months ago
2005
IEEE
Ever since the boom of World Wide Web, profiling online users' interests has become an important task for content providers. The traditional approach involves manual entry of...