We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
To address the productivity bottlenecks in power analysis and optimization of modern systems, we propose to treat power as a signal and leverage the rich set of signal processing ...
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
Paul Cockshott, Andreas Koltes, John O'Donnell, Pa...
In this paper we introduce a prototype job portal which uses semantically annotated job offers and applicants. In our opinion, using Semantic Web technologies substantially increa...
Malgorzata Mochol, Holger Wache, Lyndon J. B. Nixo...