Results 1 - 10 of 1,153

LUBM: A benchmark for OWL knowledge base systems

by Yuanbo Guo, Zhengxiang Pan, Jeff Heflin - Semantic Web Journal , 2005
"... We describe our method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications. We present the Lehigh University Benchmark (LUBM) as an example of how to design such benchmarks. The LUBM features an ontology for the university domain, synthetic OWL data sca ..."
Abstract - Cited by 378 (10 self) - Add to MetaCart
We describe our method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications. We present the Lehigh University Benchmark (LUBM) as an example of how to design such benchmarks. The LUBM features an ontology for the university domain, synthetic OWL data

A density-based algorithm for discovering clusters in large spatial databases with noise

by Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu , 1996
"... Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clu ..."
Abstract - Cited by 1786 (70 self) - Add to MetaCart
clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our

Token flow control

by Amit Kumar, et al.
"... As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design with route ..."
Abstract - Cited by 635 (35 self) - Add to MetaCart
synthetic traffic and traces from the SPLASH-2 benchmark suite show reduction in packet latency by up to 77.1 % with upto 39.6 % reduction in average router energy consumption as compared to a state-of-theart baseline packet-switched design. For the same saturation throughput as the baseline network, TFC

A database and evaluation methodology for optical flow

by Simon Baker, Daniel Scharstein, J. P. Lewis, Stefan Roth, Michael J. Black, Richard Szeliski - In Proceedings of the IEEE International Conference on Computer Vision , 2007
"... The quantitative evaluation of optical flow algorithms by Barron et al. (1994) led to significant advances in performance. The challenges for optical flow algorithms today go beyond the datasets and evaluation methods proposed in that paper. Instead, they center on problems associated with complex n ..."
Abstract - Cited by 407 (22 self) - Add to MetaCart
natural scenes, including nonrigid motion, real sensor noise, and motion discontinuities. We propose a new set of benchmarks and evaluation methods for the next generation of optical flow algorithms. To that end, we contribute four types of data to test different aspects of optical flow algorithms: (1

SLUBM: An Extended LUBM Benchmark for Stream Reasoning

by Tu Ngoc Nguyen, Wolf Siberski
"... Abstract. Stream reasoning is now emerging as a hot topic in the context of Semantic Web. As the number of data sources that continuously generates data streams emulating real-time events are increasing (and getting more diverse, i.e., from social networks to sensor networks), the task of exploiting ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
to cope with the problems of stream reasoning but there is yet no standard to measure the performance and scalability of such systems. This paper proposes a benchmarking system, which is an extension to the well-known benchmark for traditional reasoning, Lehigh University Benchmark (LUBM), to make it work

A Synthetic Benchmark

by H J Curnow, B A Wichmann, Tij Si - The Computer Journal , 1976
"... A simple method of measuring performance is by means of a benchmark program. Unless such a program is carefully constructed it is unlikely to be typical of the many thousands of programs run at an installation. An example benchmark for measuring the processor power of scientific computers is present ..."
Abstract - Cited by 111 (0 self) - Add to MetaCart
A simple method of measuring performance is by means of a benchmark program. Unless such a program is carefully constructed it is unlikely to be typical of the many thousands of programs run at an installation. An example benchmark for measuring the processor power of scientific computers

A Multi-ontology Synthetic Benchmark for the Semantic Web

by Yingjie Li, Yang Yu, Jeff Heflin
"... Abstract. One important use case for the Semantic Web is the integration of data across many heterogeneous ontologies. However, most Semantic Web Knowledge Bases are evaluated using the single ontology benchmark such as LUBM and UOBM. Therefore, there is a requirement to develop a benchmark system t ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract. One important use case for the Semantic Web is the integration of data across many heterogeneous ontologies. However, most Semantic Web Knowledge Bases are evaluated using the single ontology benchmark such as LUBM and UOBM. Therefore, there is a requirement to develop a benchmark system

Adaptive document image binarization

by J. Sauvola, M. Pietikäinen - PATTERN RECOGNITION , 2000
"... A new method is presented for adaptive document image binarization, where the page is considered as a collection of subcomponents such as text, background and picture. The problems caused by noise, illumination and many source type-related degradations are addressed. Two new algorithms are applied t ..."
Abstract - Cited by 213 (0 self) - Add to MetaCart
to determine a local threshold for each pixel. The performance evaluation of the algorithm utilizes test images with ground-truth, evaluation metrics for binarization of textual and synthetic images, and a weight-based ranking procedure for the final result presentation. The proposed algorithms were tested

Querying LUBM with Non-monotonic Features in Protége ́ using NoHR?

by Nuno Costa, Matthias Knorr
"... Abstract. The Protége ́ plug-in NoHR, which allows the user to combine an OWL 2 EL ontology with a set of non-monotonic (logic programming) rules – suitable e.g. to express defaults and exceptions – and query the combined knowl-edge base (KB), has recently been extended to OWL 2 QL in a non-trivial ..."
Abstract - Add to MetaCart
-trivial way. In this paper, we showcase this extension using an OWL 2 QL version of the well-known LUBM benchmark ontology that preserves all its reasoning features and, in addition, introduce meaningful non-monotonic rules. We can then query this extended knowledge base making use of the data sets that can

WebPIE: A Web-scale parallel inference engine using

by Jacopo Urbani A, Spyros Kotoulas A, Jason Maassen A, Frank Van Harmelen A, Henri Bal A
"... The large amount of Semantic Web data and its fast growth pose a significant computational challenge in performing efficient and scalable reasoning. On a large scale, the resources of single machines are no longer sufficient and we are required to distribute the process to improve performance. In th ..."
Abstract - Add to MetaCart
synthetic benchmark, scaling up to 100 billion triples. Results show that our implementation scales linearly and vastly outperforms current systems in terms of maximum data size and inference speed.
Results 1 - 10 of 1,153