945 search results - page 166 / 189 » Graph Types |
RAID
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
114
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
121
click to vote
SIGADA
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
117
Voted
AFRIGRAPH
2003
ACM
15 years 5 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
TRECVID
2007
15 years 2 months ago
2007
Type Run Description MAP Official A UTen English ASR 0.0031 A UTt hs-t2-nm Top-2 concepts from t hs graph method with neighbor multiply 0.0137 A UTwiki-t2-nm Top-2 Wikipedia conc...