Sciweavers

459 search results - page 42 / 92
» Mixed Models for the Analysis of Local Search Components
Sort
View
AICT
2006
IEEE
163views Communications» more  AICT 2006»
15 years 8 months ago
A Methodology for Searching Reusable Business Processes
Web Services are becoming the prominent paradigm for distributed computing and electronic businesses. This makes natural the extension of the concepts at the base of the workflow ...
Francesco Calabrese, Giovanni Di Dio, Anna Rita Fa...
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 9 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
COLT
2010
Springer
14 years 12 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
CLASSIFICATION
2006
108views more  CLASSIFICATION 2006»
15 years 1 months ago
The Practice of Cluster Analysis
Abstracts "Mixtures at the Interface" David Scott, Rice University Mixture modeling provides an effective framework for complex, high-dimensional data. The potential of m...
Jon R. Kettenring
BMCBI
2010
183views more  BMCBI 2010»
15 years 2 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...