1456 search results - page 237 / 292 » The Layer-Independent Descriptor Concept |
KDD
2006
ACM
15 years 11 months ago
2006
ACM
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
KDD
2006
ACM
15 years 11 months ago
2006
ACM
Commercial relational databases currently store vast amounts of real-world data. The data within these relational repositories are represented by multiple relations, which are int...
KDD
2005
ACM
15 years 11 months ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
KDD
2004
ACM
15 years 11 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
173
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...