A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
Visual search connects physical (offline) objects with (online) digital media. Using objects from the environment, like newspapers, magazines, books and posters, we can retrieve s...
Jamey Graham, Jorge Moraleda, Jonathan J. Hull, Ti...
In recent years, new socially-oriented Web technologies have been portrayed as placing the learner at the centre of networks of knowledge and expertise, potentially leading to new...
Strong representative democracies rely on educated, informed, and active citizenry to provide oversight of the government. We present Connect 2 Congress (C2C), a novel, high tempo...
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...