Sciweavers

2292 search results - page 177 / 459
» Structure preserving embedding
Sort
View
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 10 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
IMC
2006
ACM
15 years 10 months ago
Semi-automated discovery of application session structure
While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a ...
Jayanthkumar Kannan, Jaeyeon Jung, Vern Paxson, Ca...
EMSOFT
2004
Springer
15 years 9 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
IS
2010
15 years 2 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
TCBB
2010
106views more  TCBB 2010»
14 years 10 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro