Sciweavers

15416 search results - page 386 / 3084
» Embeddings of Computable Structures
Sort
View
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
16 years 2 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
MCS
2010
Springer
15 years 9 months ago
Selecting Structural Base Classifiers for Graph-Based Multiple Classifier Systems
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
Wan-Jui Lee, Robert P. W. Duin, Horst Bunke
IS
2010
15 years 6 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
JIB
2008
76views more  JIB 2008»
15 years 7 months ago
WebStruct and VisualStruct: web interfaces and visualization for Structure software implemented in a cluster environment
Structure, is a widely used software tool to investigate population genetic structure with multi-locus genotyping data. The software uses an iterative algorithm to group individua...
B. Jayashree, S. Rajgopal, David A. Hoisington, V....
ESOP
2009
Springer
16 years 2 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell