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...
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madha...
Perceptual audio coders use an estimated masked threshold for the determination of the maximum permissible just-inaudible noise level introduced by quantization. This estimate is d...
Recent research has shown that language and the socio-cognitive phenomena associated with it can be aptly modeled and visualized through networks of linguistic entities. However, ...