Sciweavers

4536 search results - page 745 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
14 years 11 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
IEEEPACT
2009
IEEE
14 years 5 months ago
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
Qingda Lu, Jiang Lin, Xiaoning Ding, Zhao Zhang, X...
CIKM
2007
Springer
14 years 5 months ago
Reusing relational sources for semantic information access
The rapid growth of available data arises the need for more sophisticated techniques for semantic access to information. It has been proved that using conceptual model or ontology...
Lina Lubyte
ICS
2005
Tsinghua U.
14 years 4 months ago
Disk layout optimization for reducing energy consumption
Excessive power consumption is becoming a major barrier to extracting the maximum performance from high-performance parallel systems. Therefore, techniques oriented towards reduci...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir
PREMI
2005
Springer
14 years 4 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...