Sciweavers

1458 search results - page 6 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 1 months ago
Privacy-Preserving k-NN for Small and Large Data Sets
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
Artak Amirbekyan, Vladimir Estivill-Castro
SIGMOD
2007
ACM
151views Database» more  SIGMOD 2007»
14 years 7 months ago
The case for a wide-table approach to manage sparse relational data sets
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...
Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughto...
EWNLG
1993
13 years 11 months ago
Choosing a Set of Coherence Relations for Text Generation: A Data-Driven Approach
Abstract. An active research programme in Natural Language Generation has grown up around the notion of `coherence relations'. Relations are being used in a variety of roles i...
Alistair Knott, Robert Dale
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 8 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
RR
2007
Springer
14 years 1 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...