Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Devising a scheme for efficient and scalable querying of Resource Description Framework (RDF) data has been an active area of current research. However, most approaches define new...
Eugene Inseok Chong, Souripriya Das, George Eadon,...
Mediators are considered basic architectural units for integration of distributed, heterogeneous information resources. In the paper we propose powerful virtual updateable views as...
Hanna Kozankiewicz, Jacek Leszczylowski, Kazimierz...
This paper reports on the underlying IR problems encountered when dealing with the complex morphology and compound constructions found in the Hungarian language. It describes evalu...
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...