Sciweavers

11214 search results - page 389 / 2243
» Just-in-time data structures
Sort
View
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
15 years 8 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
SCHOLARPEDIA
2008
89views more  SCHOLARPEDIA 2008»
15 years 5 months ago
Support vector clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur
PVLDB
2010
132views more  PVLDB 2010»
15 years 5 months ago
CoDA: Interactive Cluster Based Concept Discovery
Large data resources are ubiquitous in science and business. For these domains, an intuitive view on the data is essential to fully exploit the hidden knowledge. Often, these data...
Stephan Günnemann, Ines Färber, Hardy Kr...
BTW
2001
Springer
117views Database» more  BTW 2001»
15 years 11 months ago
XMach-1: A Benchmark for XML Data Management
Abstract. We propose a scaleable multi-user benchmark called XMach-1 (XML Data Management benchmark) for evaluating the performance of XML data management systems. It is based on a...
Timo Böhme, Erhard Rahm
CIDR
2007
106views Algorithms» more  CIDR 2007»
15 years 8 months ago
One table stores all: Enabling painless free-and-easy data publishing and sharing
In this paper, we present a free-and-easy data publishing and sharing system based on folksonomy. The system accepts data objects described with user-created metadata, called data...
Beng Chin Ooi, Bei Yu, Guoliang Li