Sciweavers

335 search results - page 62 / 67
» High quality graph partitioning
Sort
View
JSS
2007
121views more  JSS 2007»
13 years 9 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
PODC
2011
ACM
13 years 19 days ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 10 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
ARTCOM
2009
IEEE
13 years 7 months ago
Adaptive Encoding Algorithm for Multispectral Images
A new adaptive multispectral image compression technique based on the regions identified is proposed. The algorithm is adaptive in the sense that according to the data type class ...
Deepa Sankarapandi
KDD
2007
ACM
231views Data Mining» more  KDD 2007»
14 years 10 months ago
Xproj: a framework for projected structural clustering of xml documents
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
Charu C. Aggarwal, Na Ta, Jianyong Wang, Jianhua F...