Sciweavers

202 search results - page 25 / 41
» Dynamic and Redundant Data Placement
Sort
View
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
14 years 8 months ago
Discovering informative content blocks from Web documents
In this paper, we propose a new approach to discover informative contents from a set of tabular documents (or Web pages) of a Web site. Our system, InfoDiscoverer, first partition...
Shian-Hua Lin, Jan-Ming Ho
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
HPDC
2006
IEEE
14 years 1 months ago
Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...
Changxun Wu, Randal C. Burns
BMCBI
2010
172views more  BMCBI 2010»
13 years 2 months ago
Nonparametric identification of regulatory interactions from spatial and temporal gene expression data
Background: The correlation between the expression levels of transcription factors and their target genes can be used to infer interactions within animal regulatory networks, but ...
Anil Aswani, Soile V. E. Keränen, James Brown...
CCS
2007
ACM
14 years 1 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder