Sciweavers

43264 search results - page 8425 / 8653
» Comparing models of computation
Sort
View
SPAA
2009
ACM
15 years 11 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 11 months ago
Sustainable operation and management of data center chillers using temporal data mining
Motivation: Data centers are a critical component of modern IT infrastructure but are also among the worst environmental offenders through their increasing energy usage and the re...
Debprakash Patnaik, Manish Marwah, Ratnesh K. Shar...
MOBISYS
2009
ACM
15 years 11 months ago
SolarStore: enhancing data reliability in solar-powered storage-centric sensor networks
In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....
Yong Yang, Lili Wang, Dong Kun Noh, Hieu Khac Le, ...
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
15 years 11 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
15 years 11 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
« Prev « First page 8425 / 8653 Last » Next »