4541 search results - page 509 / 909 » Cache-Oblivious Algorithms and Data Structures |
175
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Due to its occurrence in engineering domains and implications for natural learning, the problem of utilizing unlabeled data is attracting increasing attention in machine learning....
158
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
147
click to vote
CLUSTER
2008
IEEE
16 years 29 days ago
2008
IEEE
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
178
click to vote
ISWC
2006
IEEE
16 years 15 days ago
2006
IEEE
Activity Recognition has gained a lot of interest in recent years due to its potential and usefulness for context-aware wearable computing. However, most approaches for activity r...
171
click to vote
DEXA
2005
Springer
16 years 23 hour ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...