Sciweavers

969 search results - page 35 / 194
» Clustering performance data efficiently at massive scales
Sort
View
ESCIENCE
2007
IEEE
15 years 10 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
VISUALIZATION
1996
IEEE
15 years 10 months ago
Isosurfacing in Span Space with Utmost Efficiency (ISSUE)
We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are desc...
Han-Wei Shen, Charles D. Hansen, Yarden Livnat, Ch...
SEMWEB
2010
Springer
15 years 3 months ago
Optimizing Enterprise-Scale OWL 2 RL Reasoning in a Relational Database System
OWL 2 RL was standardized as a less expressive but scalable subset of OWL 2 that allows a forward-chaining implementation. However, building an enterprise-scale forward-chaining ba...
Vladimir Kolovski, Zhe Wu, George Eadon
BMCBI
2008
122views more  BMCBI 2008»
15 years 6 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
VLDB
2002
ACM
137views Database» more  VLDB 2002»
15 years 5 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...