1487 search results - page 99 / 298 » The Computational Complexity of Link Building |
208
click to vote
CGO
2011
IEEE
14 years 7 months ago
2011
IEEE
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
125
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
117
click to vote
WEBI
2005
Springer
15 years 9 months ago
2005
Springer
Intrusion detection on the internet is a heated research field in computer science, where much work has been done during the past two decades. In this paper, we build a network-b...
149
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
133
click to vote
IPSN
2010
Springer
15 years 8 months ago
2010
Springer
The robust operation of many sensor network applications depends on deploying relays to ensure wireless coverage. Radio mapping aims to predict network coverage based on a small n...