149 search results - page 13 / 30 » What will they say |
INCDM
2010
Springer
13 years 9 months ago
2010
Springer
Defining the boundaries of a web-site, for (say) archiving or information retrieval purposes, is an important but complicated task. In this paper a web-page clustering approach to...
IPCO
2007
13 years 9 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
DAGSTUHL
2004
13 years 9 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
DM
2006
13 years 7 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...
ETS
2002
IEEE
13 years 7 months ago
2002
IEEE
Suffice to say that I'm leaving in large part because it's not much fun any more, and the directions of the university are not mine. I'm not the first, and I won�...