Sciweavers

2836 search results - page 306 / 568
» Parsing Algorithms and Metrics
Sort
View
DEXA
2008
Springer
120views Database» more  DEXA 2008»
15 years 6 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski

Publication
182views
15 years 6 months ago
Medical Image Registration: interpolations, similarities and optimizations strategies
This paper presents a study conducted for evaluating different interpolation schemes, similarity metrics and optimization algorithms for the purpose of volumetric medical image ...
R. Gallea, E. Ardizzone, R. Pirrone, O. Gambino
CSSW
2007
15 years 6 months ago
A Prototype to Explore Content and Context on Social Community Sites
: The SIOC Ontology can be used to express information from the online community sites in a machine-readable form using RDF. This rich data structure allows us to easily analyse an...
Uldis Bojars, Benjamin Heitmann, Eyal Oren
CCR
2008
62views more  CCR 2008»
15 years 4 months ago
Promoting tolerance for delay tolerant network research
So what is all this DTN research about anyway? Sceptics ask: "Why are there no DTN applications?", or "Why is DTN performance so miserable?" This article attem...
Jon Crowcroft, Eiko Yoneki, Pan Hui, Tristan Hende...
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 4 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko