Sciweavers

662 search results - page 130 / 133
» A comparative benchmark of large objects in relational datab...
Sort
View
BMCBI
2011
13 years 2 months ago
PheMaDB: A solution for storage, retrieval, and analysis of high throughput phenotype data
Background: OmniLog™ phenotype microarrays (PMs) have the capability to measure and compare the growth responses of biological samples upon exposure to hundreds of growth condit...
Wenling E. Chang, Keri Sarver, Brandon W. Higgs, T...
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
IFIP
2001
Springer
13 years 12 months ago
Security Documentation
Effective security management depends upon good risk management, which is itself based upon a reliable risk assessment, involving data collection of all the facets influencing sys...
Lam-for Kwok, Peggy P. K. Fung, Dennis Longley
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 2 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 5 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...