Sciweavers

1108 search results - page 118 / 222
» Clustered Level Planarity
Sort
View
CLUSTER
2004
IEEE
14 years 1 months ago
Hierarchical Bloom filter arrays (HBA): a novel, scalable metadata management system for large cluster-based storage
An efficient and distributed scheme for file mapping or file lookup scheme is critical in decentralizing metadata management within a group of metadata servers. This paper present...
Yifeng Zhu, Hong Jiang, Jun Wang
CAISE
2006
Springer
14 years 1 months ago
An Efficient Implementation of a Rule-based Adaptive Web Information System
Abstract. Mobile devices provide a variety of ways to access information resources available on the Web and a high level of adaptability to different aspects (e.g., device capabili...
Davide Valeriano, Roberto De Virgilio, Riccardo To...
CIKM
2006
Springer
14 years 1 months ago
Cache-oblivious nested-loop joins
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
Bingsheng He, Qiong Luo
NIPS
2003
13 years 11 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
SIGMOD
2010
ACM
151views Database» more  SIGMOD 2010»
13 years 10 months ago
Exploring schema similarity at multiple resolutions
Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...
Ken Smith, Craig Bonaceto, Chris Wolf, Beth Yost, ...