328 search results - page 66 / 66 » A word at a time: computing word relatedness using temporal ... |
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract. Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended le...