4541 search results - page 285 / 909 » Cache-Oblivious Algorithms and Data Structures |
134
Voted
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
133
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we present Triplify ? a simplistic but effective approach to publish Linked Data from relational databases. Triplify is based on mapping HTTP-URI requests onto relat...
154
Voted
AAAI
2010
15 years 16 days ago
2010
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...
181
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
A reasonable definition of intrusion is: entering a community to which one does not belong. This suggests that in a network, intrusion attempts may be detected by looking for com...
129
click to vote
DBPL
1999
Springer
15 years 8 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...