2070 search results - page 279 / 414 » Regret-Minimizing Representative Databases |
166
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
130
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
141
click to vote
CCS
2009
ACM
15 years 11 months ago
2009
ACM
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
148
click to vote
DEXA
2009
Springer
15 years 11 months ago
2009
Springer
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
120
click to vote
ACII
2007
Springer
15 years 10 months ago
2007
Springer
ended abstract reports on on-going work exploring the addition of a certain degree of control over expressivity in a unit selection context. Rather than merely choosing one unit se...